一个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...