divide-conquer

divide-conquer精品文章

• 

  [LeetCode] Flatten Binary Tree to Linked List

  ....Here we use the right pointer in TreeNode as the next pointer inListNode. Divide-Conquer Time Complexity O(n)Space Complexity O(logn) 思路 这题相当于是merge two LinkedList, 当merge linkedList的时候，关键是要知道要被连接...

  lowett 2019-08-16 10:34 评论0 收藏0
• 

  [LeetCode] Convert Sorted Array to Binary Search T

  ...ight. Notice There may exist multiple validsolutions, return any of them. Divide-Conquer Time Complexity O(N)Space Complexity O(logn) 思路 根据Binary Search Tree的性质，问题转化为找一个sorted array里的中位数，用一个helpe...

  willin 2019-08-16 10:33 评论0 收藏0