2015年1月4日
【leetcode】Unique Paths
摘要： Unique PathsA robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right a... 阅读全文
posted @ 2015-01-04 22:56 H5开发技术 阅读(169) 评论(0) 推荐(0) 编辑
【leetcode】Remove Duplicates from Sorted Array II
摘要： Remove Duplicates from Sorted Array IIFollow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =... 阅读全文
posted @ 2015-01-04 21:13 H5开发技术 阅读(135) 评论(0) 推荐(0) 编辑
【leetcode】Populating Next Right Pointers in Each Node II
摘要： Populating Next Right Pointers in Each Node IIFollow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any ... 阅读全文
posted @ 2015-01-04 20:39 H5开发技术 阅读(178) 评论(0) 推荐(0) 编辑
【leetcode】Populating Next Right Pointers in Each Node
摘要： Populating Next Right Pointers in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLi... 阅读全文
posted @ 2015-01-04 18:53 H5开发技术 阅读(201) 评论(0) 推荐(0) 编辑