Problems
classic binary search: http://www.lintcode.com/en/problem/classical-binary-search/
search insert position: http://www.lintcode.com/en/problem/search-insert-position/
search a 2d matrix: http://www.lintcode.com/en/problem/search-a-2d-matrix/
search in a big sorted array: http://www.lintcode.com/en/problem/search-in-a-big-sorted-array/
find minimum in a rotated sorted array: http://www.lintcode.com/en/problem/find-minimum-in-rotated-sorted-array/
search in a rotated sorted array: http://www.lintcode.com/en/problem/search-in-rotated-sorted-array/
sqrt(x): http://www.lintcode.com/problem/sqrtx/
wood cut: http://www.lintcode.com/en/problem/wood-cut/
count of smaller number: http://www.lintcode.com/en/problem/count-of-smaller-number/
- search insertion position
search for a range: http://www.lintcode.com/en/problem/search-for-a-range/
find peak element: http://www.lintcode.com/en/problem/find-peak-element/
rotate string: http://www.lintcode.com/en/problem/rotate-string/
- 三步翻转
recover rotated sorted array: http://www.lintcode.com/en/problem/recover-rotated-sorted-array/
- find min
- 三步翻转
给出两个整数A和B，在不使用div和mod操作的情况下求得A整除B的值
http://www.lintcode.com/en/problem/divide-two-integers/
给出一个排好序的整数数组和一个数A，返回A在数组中出现的次数
http://www.lintcode.com/en/problem/total-occurrence-of-target/
给出一个先上升后下降的整数序列，返回序列中最大的那个数的位置
http://www.lintcode.com/en/problem/maximum-number-in-mountain-sequence/
有n根绳子按一定顺序排列，长度各异。一根合格的绳子的长度至少为m，现在希望你连接某些相邻的绳子，从而尽可能获得最多的合格的绳子，问最多可以获得多少合格的绳子
http://www.lintcode.com/en/problem/copy-books/
(source: http://www.jiuzhang.com/qa/974/\