發(fā)簡(jiǎn)信
IP屬地：華盛頓州
-
leetcode-tree relevant
一個(gè)inorder traverse 的iteration： 先循環(huán)左邊，左邊循環(huán)完循環(huán)右邊，但是右邊的node也要循環(huán)他的左邊，所以要把循環(huán)左...
-
leetcode-12
Coin Change Boundary: There may be no possible change, so in this scenar...
-
leetcode-11
House Robber [2,1,1,2] => 并不是每隔一個(gè)加一就是最佳最佳問(wèn)題=>考慮DP=>思考循環(huán)的關(guān)聯(lián)對(duì)于一個(gè)nums[i]: r...
-
MAC OSX下opencv 4的靜態(tài)庫(kù)編譯與連接/ compile and link opencv static library under OSX我！終于！成功在MAC下面把opencv4程序靜態(tài)編譯起來(lái)了！先上compile的命令：g++ -std=c++11 main.cpp prep...
-
leetcode-Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock 其實(shí)也算是DP，每次的結(jié)果和前一次的結(jié)果比較 Best Time to Buy ...
-
leetcode-9
Subsets Bit manipulation and map can be useful aside from backtracking P...
-
leetcode-8
Climbing Stairs Just Fibonacci. Dynamic Programming's space complexity c...
-
Backtracking
Combination Sum Most basic backtracking. The idea of begin position is e...
-
leetcode-day6
輸入值是指針考慮是不是NULL， next是不是NULL輸入值是數(shù)組考慮長(zhǎng)度為0 Search a 2D Matrix II Instead o...