旋转数组最小值

 private static int getNum(int []input){
         if(null == input || 0 == input.length) return 0;
         int i = 0;
         int j= input.length - 1;
         while(input[i]>=input[j]){
             if (j - i == 1) return input[j];
             int mid = i + (j - i) / 2;
             if (input[mid] >= input[i]){ i = mid;}
             else if (input[mid] <= input[j]){ j = mid;}
         }
         return input[i];
     }