[ 80 questions / 3 ~= 27 a month..ok.. ] 1.29: remove_duplicatesI-III focus on III blah...

[ 80 questions / 3 ~= 27 a month..ok.. ] 1.29: remove_duplicatesI-III focus on III blah...
4.1] 实现一个函数,检查二叉树是否平衡。(任二子树高度差不超过一) depth of tree node: # edges from root to nodeheight...
😊😊😊
8.31cc栈和队列像是夏日的最后一天 - to do 3.1】用一个数组实现三个栈 3.2】 How would you design a stack which, in addition t...
像是夏日的最后一天 - to do 3.1】用一个数组实现三个栈 3.2】 How would you design a stack which, in addition t...
😍👍👍
c++ lib funcs- vector fill(v.begin(), v.end(), 0);
- vector fill(v.begin(), v.end(), 0);
计划很好^O^👯
立了flag=>计划- 8.22-26 Mon-Fri review old problems, note where's weak go over corresponding cc150 pa...
👍👍
8.16 dp decodeWays & distinctSubsequence & wordBreak I-II- to do - 13.10] Decode Ways totally ignored the special case...! (think what it is) d...
- to do - 13.10] Decode Ways totally ignored the special case...! (think what it is) d...
😍
8.13 dp: triangle & maximumSubArr & palindromePartitionIIto do 13.1] Triangle 一开始理解错了,adjacent是说下一行可以保持index或是index+1 - naive method n*n space a...
to do 13.1] Triangle 一开始理解错了,adjacent是说下一行可以保持index或是index+1 - naive method n*n space a...
要注意休息哦!
8.10 *Greedy* JumpGame I&II- to do 12.1] Jump Game stepping from top towards bottom naive ..........................
几天没看,新添了好几篇,👍👍
8.14 dp maximalRec & bestTimeToBuy & InterleavingStr- to do - before 13.4] Maximal Square mark: improve using rotating array - again Larges...
喜欢,常来看看呗。
7.25 BFS[ Purpose ] We implemented a distributed grep system that allows user to run grep on lo...
最近很用功哦(⊙o⊙)
7.25 BFS[ Purpose ] We implemented a distributed grep system that allows user to run grep on lo...
你这么努力,会有收获的^O^
7.19 subsetII & nextPermutationto do subset还有其他做法,下遍看 1] Subsets II recursive iterative reconsider w/ backtracking回头看答...
这几天好努力啊👯
7.19 subsetII & nextPermutationto do subset还有其他做法,下遍看 1] Subsets II recursive iterative reconsider w/ backtracking回头看答...
👍
7.17 sorting ~findMissing桶排序to do 1] Merge Sorted Array 注意comment out的一句可省 2] Merge Two Sorted Lists 2] see below 3...