技術標籤：刷題leetcode演算法資料結構java

題目描述

程式碼

class Solution {
    public int minArray(int[] numbers) {
        int length = numbers.length;
        int left = 0;
        int right = length - 1;
        int mid = 0;
        while(left < right){
            mid = left + (right - left)/2;
            if(numbers[
 
mid] > numbers[right]){
                left = mid +1;
            }else if(numbers[mid] < numbers[right]){
                right--;
            }else{
                right--;
            }
        }
        return numbers[left];
    }
}