[leetcode]81 Search in rotated Sorted Array II

https://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/

http://blog.csdn.net/linhuanmars/article/details/20588511

Public class solution {    public boolean search (Int[] A,  int target)  {        if  (a == null  | |  a.length == 0)             return  false;        return find (A, 0, A.length -  1, target);     }        // o (n)     private boolean find (Int[] a, int low, int high,  int t)     {        if  (low  > high)             return false;                      if  (low  == high)             return A[low]  == t;                     int mid =  (Low + high)  / 2;                 if  (a[mid] == t)              return true;                     if  (A[mid ] > a[low])         {             if  (a[low] <= t && t < a[ MID])                 return  find (A, low,  mid - 1, t); // left part             else                 return find (a, mid + 1, high, t);         }        else if  (a[mid] <  a[low])         {             if  (T > a[mid] && t <= a[high])                  return find (A, &NBSP;MID&NBSP;+&NBSP;1,&NBSP;HIGH,&NBSP;T); // right part             else                &nbSp;return find (a, low, mid - 1, t);         }        else        {             return find (A, low + &NBSP;1,&NBSP;HIGH,&NBSP;T); // just shift left.         }    }}

[leetcode]81 Search in rotated Sorted Array II