[Leetcode]searchinrotatedsortedarrayii搜索旋转有序数组

 1 class Solution {
 2 public:
 3     bool search(int A[], int n, int target) 
 4     {
 5         if(n==0)    return false;
 6         int lo=0,hi=n-1;
 7         while(lo<=hi)
 8         {
 9             int mid=(lo+hi)/2;
10             if(A[mid]==target)
11                 return true;
12             else if(A[mid]<A[hi])
13             {
14                 if(A[mid]=target)
15                     lo=mid+1;
16                 else
17                     hi=mid-1;
18             }
19             else if(A[mid]>A[hi])
20             {
21                 if(A[lo]<=target&&A[mid]>target)
22                     hi=mid-1;
23                 else
24                     lo=mid+1;
25             }
26             else      //重点理解
27                 hi--;
28         }
29         return false;    
30     }
31 };