8 旋转数组的最小数字

输入一个递增排序数组的一个旋转，输出旋转数组的最小元素
例如1,2,3,4,5的一个旋转可以为3,4,5,1,2
把一个数组的最开始若干个元素搬到数组的末尾，称之为数组的旋转

输出旋转数组的最小元素

C++:

class Solution {
public:
    int minInOrder(vector<int> rotateArray , int left , int right) {
        int res = rotateArray[left] ;
        for (int i = left ; i <= right ; i++){
            if (rotateArray[i] < res)
                res = rotateArray[i] ;
        }
        return res ;
    }
    
    int minNumberInRotateArray(vector<int> rotateArray) {
        int len = rotateArray.size() ;
        if (len <= 0)
            return 0 ;
        int left = 0 ;
        int right = len - 1 ;
        int mid = left ;
        while(rotateArray[left] >= rotateArray[right]){
            if (right-left == 1){
                mid = right ;
                break ;
            }
            mid = (left+right)>>1 ;
            if (rotateArray[left] == rotateArray[mid] && rotateArray[mid] == rotateArray[right]){
                return minInOrder(rotateArray,left,right) ;
            }
            if (rotateArray[mid] >= rotateArray[left]){
                left = mid ;
            }else if (rotateArray[mid] <= rotateArray[right]){
                right = mid ;
            }
        }
        return rotateArray[mid] ;
    }
};

java:

import java.util.ArrayList;
public class Solution {
    public int minNumberInRotateArray(int [] nums) {
        if (nums.length == 0)
            return 0 ;
        int left = 0 ;
        int right = nums.length - 1 ;
        while(left < right){
            int mid = left + (right - left) / 2 ;
            if (nums[left] == nums[mid] && nums[mid] == nums[right]){
                return minNumber(nums , left , right) ;
            }else if (nums[mid] <= nums[right]){
                right = mid ;
            }else{
                left = mid + 1 ;
            }
        }
        return nums[left] ;
    }
    
    private int minNumber(int [] nums , int left , int right) {
        int res = nums[left] ;
        for(int i = left ; i <= right ; i++){
            if (nums[i] < res){
                res = nums[i] ;
            }
        }
        return res ;
    }
}