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) 思路 這題相當(dāng)于是merge two LinkedList, 當(dāng)merge linkedList的時(shí)候，關(guān)鍵是要知道要被連接...

  lowett 2019-08-16 10:34 評(píng)論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) 思路 根據(jù)Binary Search Tree的性質(zhì)，問(wèn)題轉(zhuǎn)化為找一個(gè)sorted array里的中位數(shù)，用一個(gè)helpe...

  willin 2019-08-16 10:33 評(píng)論0 收藏0