Summary: The two-part topic summary and the two-way template

Two-part template:

1         while (L < r-1) {2             int m = l + (r-l)/2, 3              4             //means that there is no rotate. 5             . . The various exit conditions are added here, such as finding the target value etc 8              9             //left side is sorted.10             if (a[m] > a[l]) {one                 L = m;12             } else {                 r =      

Related dichotomy topic Links:leetcode New topic: Find Minimum in rotated Sorted Array problem Solving report-two-way template solutionleetcode New topic: Find Minimum in rotated Sorted Array II solution ...Leetcode:search in rotated Sorted Array II Problem Solving report-Blog ParkLeetcode:search in rotated Sorted Array problem Solving report-Yu ' s ...leetcode:search Insert Position Problem Solving report-Yu ' s garden ...Leetcode:search A 2D Matrix problem solving report-Yu ' s Garden-blog Park

Summary: The two-part topic summary and the two-way template