vercont

摘要： 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 阅读(157) 评论(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 阅读(167) 评论(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 阅读(106) 评论(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 阅读(104) 评论(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 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 阅读(120) 评论(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 阅读(126) 评论(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)