vercont

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

posted @ 2018-09-23 00:41 vercont 阅读(106) 评论(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 阅读(113) 评论(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)

摘要： 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 阅读(130) 评论(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)

摘要： 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)

摘要： Given an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear... 阅读全文

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

摘要： Given an array of integers, every element appears three times except for one. Find that single one.Note: Your algorithm should have a ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(77) 评论(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 阅读(103) 评论(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 阅读(139) 评论(0) 推荐(0)