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 阅读(90) 评论(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 阅读(130) 评论(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 阅读(123) 评论(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 阅读(153) 评论(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 阅读(115) 评论(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 阅读(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 阅读(140) 评论(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 阅读(174) 评论(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 阅读(122) 评论(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 阅读(150) 评论(0) 推荐(0)