real_lisa的博客

同向双指针 Window Sum [easy] Move Zeroes [easy] Remove Duplicate Numbers In Array [easy]   相向双指针 Valid Palindrome Rotate String Recover Rotate Sorted Array   Two Sum Two Sum Two Sum II Two Sum...

算法 Algorithm 1. two pointers 2. binary search  binary tree & divide and conquer 3. backtracking / DFS / recursion               BFS / union find     dynamic programming     greedy 4. sort /...

Traverse the Binary Tree preorder  (visit, left, right) Binary Tree Preorder Traversal [easy] inorder     (left, visit, right) Binary Tree Inorder Traversal [easy] postorder(left, right, visit) ...

难点1: 搞清楚左右边界 难点2: 写合适的if condition   基础 Classical Binary Search [easy] int findPosition(vector<int> &nums, int target) { int l=0, r=nums.size(); while(l<r){ int mid ...