vercont

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

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

摘要： Given a singly linked list L: L 0→L 1→…→L n-1→L n, reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…You must do this in-place without alte... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(180) 评论(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 阅读(104) 评论(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 阅读(116) 评论(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 阅读(148) 评论(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 阅读(113) 评论(0) 推荐(0)

摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals ... 阅读全文

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

摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals ... 阅读全文

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

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example: Given the below bin... 阅读全文

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

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example: Given the below bin... 阅读全文

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