总结：二分法题目汇总 以及二分法模板

二分法模板:

 1         while (l < r - 1) {
 2             int m = l + (r - l) / 2;
 3             
 4             // means that there is no rotate.
 5             ... 这里添加各种退出条件，比如找到了目标值等 8             
 9             // left side is sorted.
10             if (A[m] > A[l]) {
11                 l = m;
12             } else {
13                 r = m;
14             }
15         }    

相关二分法题目链接：

LeetCode 新题: Find Minimum in Rotated Sorted Array 解题报告-二分法模板解法

LeetCode 新题: Find Minimum in Rotated Sorted Array II 解 ...

LeetCode: Search in Rotated Sorted Array II 解题报告 - 博客园

LeetCode: Search in Rotated Sorted Array 解题报告- Yu's ...

LeetCode: Search Insert Position 解题报告- Yu's Garden ...

LeetCode: Search a 2D Matrix 解题报告- Yu's Garden - 博客园

LeetCode: Search for a Range 解题报告

LeetCode: Pow(x, n) 解题报告- Yu's Garden - 博客园

LeetCode:Sqrt(x) 解题报告