Offer 11. 旋转数组的最小数字（minArray）

Offer 11. 旋转数组的最小数字（minArray）

1. python

class Solution:
    def minArray(self, numbers: List[int]) -> int:
        length = len(numbers)
        for i in range(1,length):
            if numbers[i]<numbers[i-1]:
                return numbers[i]
        return numbers[0]
        

---

2. Java

class Solution {
    public int minArray(int[] numbers) {
        for(int i =1;i<numbers.length;i++){
            if(numbers[i]<numbers[i-1]){
                return numbers[i];
            }
        }
        return numbers[0];

    }
}

---