2018年8月17日
283. Move Zeroes
摘要： Solution: make a queu and coun the number of 0 or use two pointers clerverly(think aboun the logic) 阅读全文
posted @ 2018-08-17 12:55 wz30 阅读(162) 评论(0) 推荐(0)
Graph 133. Clone Graph in three ways(bfs, dfs, bfs(recursive))
摘要： 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 阅读全文
posted @ 2018-08-17 12:40 wz30 阅读(496) 评论(0) 推荐(0)