Counting Bits [method1] naive O(n*sizeof(int)) side note num/2 ===> num>>1num%2 ===> nu...
發(fā)簡(jiǎn)信
IP屬地：加州
-
bit manipulation -
1.29-。。。 數(shù)列[ 80 questions / 3 ~= 27 a month..ok.. ] 1.29： remove_duplicatesI-III focus on III blah...
-
9.16 基本樹(shù)遍歷
--- knowledge ---# of leaves = # of nonleaves + 1 - Binary Tree Inorder Traversal Th...
-
9.5 cc dp-rotate now
9.1] Climbing Stairs LIC dp O(n^2)lenLIS[i] = max (lenLIS[j] + 1), where nums[j]<nums[i...
-
9.1 cc樹(shù)與圖
4.1] 實(shí)現(xiàn)一個(gè)函數(shù)，檢查二叉樹(shù)是否平衡。（任二子樹(shù)高度差不超過(guò)一） depth of tree node: # edges from root to nodeheight...
-
8.31cc棧和隊(duì)列像是夏日的最后一天 - to do 3.1】用一個(gè)數(shù)組實(shí)現(xiàn)三個(gè)棧 3.2】 How would you design a stack which, in addition t...
-
8.25 more arrays (c++ set)
- Find Minimum in Rotated Sorted Array it counts when it's not roated note the while lo...
-
8.23 cc 數(shù)組和字符串[pt2]
to do cc150 array&string (6-11)/11 leetcode review day 1 1.6] Rotate N*N matrix by 90 d...
-
8.22 數(shù)組和字符串[PT1] cc150
- to do finish array&string (1-6)/11 on cc150 p66 - note unicode vs. ASCII: ASCII defin...
-
立了flag=>計(jì)劃
- 8.22-26 Mon-Fri review old problems, note where's weak go over corresponding cc150 pa...
-
6.19 removeNthNodeFromEnd & swapNodesInPairs & reverseNodesInK-groups & copyListWithRandomPointer
6.19 to do unhandled special cases arise w/o help of dummy 2] Swap Nodes in Pairs note：...
-
6.18 removeDupFromSortedArray I,II & rotateList
to dobtw.-1] Remove Duplicates from Sorted Array 0] Remove Duplicates from Sorted Array...
-
6.17 addTwoNumbers & reverseLinkedListII & partitionList
to do 5%.. Reverse Linked List simple iterative - JS simple recursive - JS 2] Reverse L...
-
6.16 candy & SingleNumber I,II
to do 1] Single NumbereeeeeiNo extra memory, 2] Single Number IInote the vector marks(...