LeetCode Link 思路：按層剪掉 leaf nodes淘讥，當(dāng)最終只剩一個或者兩個 nodes拌牲，即為題解 可以使用 HashMap > map，這樣就不用使用 inde...
IP屬地：華盛頓州
-
310. Minimum Height Trees
-
169 Follow Up: 229. Majority Element II
給定 array of integers, 返回個數(shù)多余 len/3 的 items要求： Linear Runtime, O(1) Space 思路：滿足條件的 items...
-
169. Majority Element給定一個 array披坏，輸出超出半數(shù)的 item 一題多解缸血，各種思路逊桦，面試熱點問題谈喳。From 花花醬, 題解思路如下: Solution 1: HashMap Runtime:...
-
238. Product of Array Except Self
LeetCode Link下面的 Solution 可以 optimize to O(1) space: leftToRight as res rightToLeft sto...
-
236. Lowest Common Ancestor of a Binary Tree
LeetCode Solution 1 Solution 2 with parent reference Solution 3 Find Two path and compa...
-
207. & 210. Course Schedule I & II
Course Schedulehttp://www.reibang.com/p/341a09e86930 Course Schedule IIhttps://www.jia...
-
139. & 140. Word Break I & II
Word Break:http://www.reibang.com/p/c661daf51a01 Word Break IIhttp://www.reibang.com/...
-
78.& 90. Subsets I & II
Given a set of distinct integers, nums, return all possible subsets (the power set). No...
-
49. Group Anagrams
Given an array of strings, group anagrams together. Example: Note: All inputs will be i...
-
-
-
353. Design Snake Game題目分析: Move 會有以下幾種情況：out of boarder => return -1hit self => return -1special case: 如果下一個...
-
Fibonacci
題目鏈接：Fibonacci In mathematics, the Fibonacci numbers are the numbers in the following i...
-
366. Find Leaves of Binary TreeLeetCode Link depth and height are properties of a node:The depth of a node is the numb...
-
-
84. Largest Rectangle in Histogram這種 Wrapper 方式比較好理解題解思路钮孵，以及處理 Corner case骂倘。下面的題解思路同上面一致。 另一種類似寫法：
-
-
-
281. Zigzag IteratorLeetCode Link Follow up: Extend to List of List List of iterators如果保持所有的 iterators巴席，那么 n...