
一個inorder traverse 的iteration: 先循環左邊,左邊循環完循環右邊,但是右邊的node也要循環他的左邊,所以要把循環左...
Coin Change Boundary: There may be no possible change, so in this scenar...
House Robber [2,1,1,2] => 并不是每隔一個加一就是最佳最佳問題=>考慮DP=>思考循環的關聯對于一個nums[i]: r...
我!終于!成功在MAC下面把opencv4程序靜態編譯起來了!先上compile的命令:g++ -std=c++11 main.cpp prep...
Best Time to Buy and Sell Stock 其實也算是DP,每次的結果和前一次的結果比較 Best Time to Buy ...
Subsets Bit manipulation and map can be useful aside from backtracking P...
Climbing Stairs Just Fibonacci. Dynamic Programming's space complexity c...
Combination Sum Most basic backtracking. The idea of begin position is e...
輸入值是指針考慮是不是NULL, next是不是NULL輸入值是數組考慮長度為0 Search a 2D Matrix II Instead o...