摘要：
Solution: make a queu and coun the number of 0 or use two pointers clerverly(think aboun the logic) 阅读全文
摘要：
Basically just clone the graph like clone a list in leetcode 138. there are three ways t solve this (just traverse the graph and put new node into map 阅读全文