2015年1月29日
[LeetCode#117]Populating Next Right Pointers in Each Node II
摘要： The problem:Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous s... 阅读全文
posted @ 2015-01-29 11:46 airforce 阅读(170) 评论(0) 推荐(0)
[LeetCode#23]Merge k Sorted Lists
摘要： The problem:Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.My analysis:The is problem could be elegan... 阅读全文
posted @ 2015-01-29 05:58 airforce 阅读(151) 评论(0) 推荐(0)