Counting Bits [method1] naive O(n*sizeof(int)) side note num/2 ===> num>>1num%2 ===> nu...

Counting Bits [method1] naive O(n*sizeof(int)) side note num/2 ===> num>>1num%2 ===> nu...
167] Two Sum II - Input array is sorted
[ 80 questions / 3 ~= 27 a month..ok.. ] 1.29: remove_duplicatesI-III focus on III blah...
--- knowledge ---# of leaves = # of nonleaves + 1 - Binary Tree Inorder Traversal Th...
9.1] Climbing Stairs LIC dp O(n^2)lenLIS[i] = max (lenLIS[j] + 1), where nums[j]<nums[i...
4.1] 实现一个函数,检查二叉树是否平衡。(任二子树高度差不超过一) depth of tree node: # edges from root to nodeheight...
像是夏日的最后一天 - to do 3.1】用一个数组实现三个栈 3.2】 How would you design a stack which, in addition t...
- to do - linked-list-random-node 水塘抽样是一系列的随机算法,其目的在于从包含n个项目的集合S中选取k个样本,其中n为一很大或未知的数量,尤...
Proposal: - background: Social media has been rapidly gaining its impacts on our cultur...
- Find Minimum in Rotated Sorted Array it counts when it's not roated note the while lo...
- ro do cc linked list review day 2
- vector fill(v.begin(), v.end(), 0);
to do cc150 array&string (6-11)/11 leetcode review day 1 1.6] Rotate N*N matrix by 90 d...
- to do finish array&string (1-6)/11 on cc150 p66 - note unicode vs. ASCII: ASCII defin...
- 8.22-26 Mon-Fri review old problems, note where's weak go over corresponding cc150 pa...
https://www.douban.com/note/330562764/
6.19 to do unhandled special cases arise w/o help of dummy 2] Swap Nodes in Pairs note:...
to dobtw.-1] Remove Duplicates from Sorted Array 0] Remove Duplicates from Sorted Array...
to do 5%.. Reverse Linked List simple iterative - JS simple recursive - JS 2] Reverse L...
to do 1] Single NumbereeeeeiNo extra memory, 2] Single Number IInote the vector marks(...