一個(gè)inorder traverse 的iteration： 先循環(huán)左邊，左邊循環(huán)完循環(huán)右邊，但是右邊的node也要循環(huán)他的左邊，所以要把循環(huán)左邊的while循環(huán)和獲得右邊n...
發(fā)簡信
IP屬地：華盛頓州
-
leetcode-tree relevant
-
leetcode-12
Coin Change Boundary: There may be no possible change, so in this scenario, should chec...
-
leetcode-11
House Robber [2,1,1,2] => 并不是每隔一個(gè)加一就是最佳最佳問題=>考慮DP=>思考循環(huán)的關(guān)聯(lián)對于一個(gè)nums[i]: rob, 那么至此得到的總價(jià)是 ...
-
MAC OSX下opencv 4的靜態(tài)庫編譯與連接/ compile and link opencv static library under OSX我！終于！成功在MAC下面把opencv4程序靜態(tài)編譯起來了！先上compile的命令：g++ -std=c++11 main.cpp preprocess.cpp -fra...
-
leetcode-Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock 其實(shí)也算是DP，每次的結(jié)果和前一次的結(jié)果比較 Best Time to Buy and Sell Stock ...
-
leetcode-9
Subsets Bit manipulation and map can be useful aside from backtracking Path Sum Don't s...
-
leetcode-8
Climbing Stairs Just Fibonacci. Dynamic Programming's space complexity can be optimized...
-
Backtracking
Combination Sum Most basic backtracking. The idea of begin position is excellent, avoid...
-
leetcode-day6
輸入值是指針考慮是不是NULL， next是不是NULL輸入值是數(shù)組考慮長度為0 Search a 2D Matrix II Instead of beginning wit...
-
leetcode-day5
暑假一定要好好刷題-皿- 為了不996 Maximum Subarray Pay attention to boundary contidion. When initiali...
-
leetcode-day2
Longest Substring Without Repeating Characters Insert postion for unsorted_set is deffe...
-
leetcode-day3
Valid Parentheses Boundary Condition: consider just having left parenthese and right pa...
-
513-LAB0 單向鏈表
free 鏈表時(shí)沒有考慮鏈表是NULL的情況 如果malloc newh->value 失敗，返回錯誤時(shí)要把之前成功malloc的newh取消
-
leetcode-day1
Two Sum Brute Force: time O(n^2) space O(1) Hash Map: time O(n) space O(n) Add Two Numb...
-
開源中國社區(qū)官方賬號，每天為開發(fā)者推送最新最熱的技術(shù)資訊。
-
Hi，很高興在@IT·互聯(lián)網(wǎng)專題遇見你。 收錄范圍：收錄IT&互聯(lián)網(wǎng)行業(yè)觀察與思考，數(shù)碼產(chǎn)品極客體驗(yàn)分析等類型文章 投稿須知：http://www.itdecent.cn/p/4edc76104c27 專題主編：@若錦 http://www.itdecent.cn/u/e4c63b354a77 官方社群：可聯(lián)系添加 @若錦 加入專題官方社群交流、學(xué)習(xí)，添加時(shí)備注簡書ID。
