二分法模板:
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 - 博客園