爆炸的熱水袋

一個(gè)inorder traverse 的iteration： 先循環(huán)左邊，左邊循環(huán)完循環(huán)右邊熙卡，但是右邊的node也要循環(huán)他的左邊杖刷，所以要把循環(huán)左邊的while循環(huán)和獲得右邊n...

爆炸的熱水袋

Coin Change Boundary: There may be no possible change, so in this scenario, should chec...

爆炸的熱水袋

House Robber [2,1,1,2] => 并不是每隔一個(gè)加一就是最佳最佳問(wèn)題=>考慮DP=>思考循環(huán)的關(guān)聯(lián)對(duì)于一個(gè)nums[i]: rob, 那么至此得到的總價(jià)是 ...

爆炸的熱水袋

Best Time to Buy and Sell Stock 其實(shí)也算是DP，每次的結(jié)果和前一次的結(jié)果比較 Best Time to Buy and Sell Stock ...

爆炸的熱水袋

Subsets Bit manipulation and map can be useful aside from backtracking Path Sum Don't s...

爆炸的熱水袋

Climbing Stairs Just Fibonacci. Dynamic Programming's space complexity can be optimized...

爆炸的熱水袋

Combination Sum Most basic backtracking. The idea of begin position is excellent, avoid...

爆炸的熱水袋

輸入值是指針考慮是不是NULL喂柒， next是不是NULL輸入值是數(shù)組考慮長(zhǎng)度為0 Search a 2D Matrix II Instead of beginning wit...

爆炸的熱水袋

暑假一定要好好刷題-皿- 為了不996 Maximum Subarray Pay attention to boundary contidion. When initiali...

爆炸的熱水袋

Longest Substring Without Repeating Characters Insert postion for unsorted_set is deffe...

爆炸的熱水袋

Valid Parentheses Boundary Condition: consider just having left parenthese and right pa...

爆炸的熱水袋

free 鏈表時(shí)沒(méi)有考慮鏈表是NULL的情況 如果malloc newh->value 失敗不瓶，返回錯(cuò)誤時(shí)要把之前成功malloc的newh取消

爆炸的熱水袋

來(lái)源：http://john-ahlgren.blogspot.com/2013/10/stl-container-performance.html

爆炸的熱水袋

Two Sum Brute Force: time O(n^2) space O(1) Hash Map: time O(n) space O(n) Add Two Numb...