[jzof] 11 minimum number of rotation array

describe ：
There is a length of n Non descending array of , such as [1,2,3,4,5], Rotate it , That is, move the first elements of an array to the end of the array , Into a rotating array , For example, it became [3,4,5,1,2], perhaps [4,5,1,2,3] In this way . Excuse me, , Given such a rotation array , Find the minimum value in the array .

Data range ：1≤n≤10000, The value of any element in the array : 0<=val≤10000;
requirement ： Spatial complexity ：O(1) , Time complexity ：O(logn).

import java.util.ArrayList;
public class Solution {
    
    public int minNumberInRotateArray(int [] array) {
    
        //  Judgment of special circumstances 
        if (array.length== 0) {
    
            return 0;
        }
        //  Left and right pointer i j
        int i = 0, j = array.length - 1;
        //  loop 
        while (i < j) {
    
            //  Find the midpoint of the array  m
            int m = (i + j) / 2;
            // m In the left sort array , Rotation point at  [m+1, j]  in 
            if (array[m] > array[j]) i = m + 1;
            // m  In the right sort array , Rotation point at  [i, m] in 
            else if (array[m] < array[j]) j = m;
            //  Narrow down and continue to judge 
            else j--;
        }
        //  Return to the rotation point 
        return array[i];
    }
}