爆炸的热水袋

一个inorder traverse 的iteration： 先循环左边，左边循环完循环右边，但是右边的node也要循环他的左边，所以要把循环左边的while循环和获得右边n...

爆炸的热水袋

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

爆炸的热水袋

House Robber [2,1,1,2] => 并不是每隔一个加一就是最佳最佳问题=>考虑DP=>思考循环的关联对于一个nums[i]: rob, 那么至此得到的总价是 ...

爆炸的热水袋

Best Time to Buy and Sell Stock 其实也算是DP，每次的结果和前一次的结果比较 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输入值是数组考虑长度为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 链表时没有考虑链表是NULL的情况 如果malloc newh->value 失败，返回错误时要把之前成功malloc的newh取消

爆炸的热水袋

来源：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...