發(fā)簡信
IP屬地：加州
-
bit manipulationCounting Bits [method1] naive O(n*sizeof(int)) side note num/2 ===> num>...
-
9.26 排序
167] Two Sum II - Input array is sorted
-
1.29-。。。 數(shù)列[ 80 questions / 3 ~= 27 a month..ok.. ] 1.29： remove_duplicatesI-III fo...
-
9.16 基本樹遍歷
--- knowledge ---# of leaves = # of nonleaves + 1 - Binary Tree Inord...
-
9.5 cc dp-rotate now
9.1] Climbing Stairs LIC dp O(n^2)lenLIS[i] = max (lenLIS[j] + 1), where...
-
9.1 cc樹與圖
4.1] 實現(xiàn)一個函數(shù)，檢查二叉樹是否平衡。（任二子樹高度差不超過一） depth of tree node: # edges from roo...
-
8.31cc棧和隊列像是夏日的最后一天 - to do 3.1】用一個數(shù)組實現(xiàn)三個棧 3.2】 How would you design a stack which...
-
8.30 鏈表
- to do - linked-list-random-node 水塘抽樣是一系列的隨機算法，其目的在于從包含n個項目的集合S中選取k個樣本，...
-
8.26 cc鏈表
Proposal: - background: Social media has been rapidly gaining its impact...