九章 Binary Search

九章 Binary Search

1. find the first target
2. find the last target
3. find the range of a target [leetcode]
4. find the insert position of a target [leetcode]
5. find in rotated sorted array [leetcode]
6. find in rotated sorted array (with duplication in the array) [leetcode]
7. search a 2D Matrix
8. search a 2D matrix (not extremely bigger in each row)      
9. find the first bad version
10. find a peak


Sorted array  
1. remove duplicate from array  
2. merge sorted array
3. Median of two sorted array
4. find kth of two sorted array
5. recover rotated sorted array  -> offset
6. rotated string
7. reverse word lists