vercont

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For exampl... 阅读全文

posted @ 2018-09-24 18:11 vercont 阅读(163) 评论(0) 推荐(0)

摘要： Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that s... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(132) 评论(0) 推荐(0)

摘要： Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that s... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(104) 评论(0) 推荐(0)

摘要： Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(94) 评论(0) 推荐(0)

摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previo... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(105) 评论(0) 推荐(0)

摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previo... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(127) 评论(0) 推荐(0)

摘要： Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(115) 评论(0) 推荐(0)

摘要： Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(104) 评论(0) 推荐(0)

摘要： Sort a linked list in O(n log n) time using constant space complexity.C++/** * Definition for singly-linked list. * struct ListNode { ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(131) 评论(0) 推荐(0)

摘要： Sort a linked list in O(n log n) time using constant space complexity.C++/** * Definition for singly-linked list. * struct ListNode { ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(109) 评论(0) 推荐(0)