Leecode brush questions record sword finger offer 11 Rotate the minimum number of the array

topic

Move the first elements of an array to the end of the array , We call it rotation of arrays .

Give you a chance to exist repeat An array of element values numbers , It turns out to be an ascending array , And a rotation is carried out according to the above situation . Please return the smallest element of the rotation array . for example , Array [3,4,5,1,2] by [1,2,3,4,5] A rotation of , The minimum value of the array is 1.

Example 1：

Input ：[3,4,5,1,2]
Output ：1
Example 2：

Input ：[2,2,2,0,1]
Output ：0

answer

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

        }
        return numbers[numbers.length-1];
    }
}