7. Dichotomy -- find a set of repeated or ordered but rotating arrays

Title Description ：

• Input ：numbers = [3,4,5,1,2]
  Output ：1
• Input ：numbers = [2,2,2,0,1]
  Output ：0

public int minArray(int[] numbers) {
        int low = 0, high = numbers.length-1;
        while(low < high){
            int temp = (low + high) / 2;
            if(numbers[temp] > numbers[high]) low = temp + 1;
            else if(numbers[temp] < numbers[high]) high = temp;
            else high--;

        }
        return numbers[low];
    }

I originally wanted to use double pointers , But beyond the time limit . It's faster to use dichotomy , Because I didn't grasp the key point , It's a question , This string of arrays , It is composed of repetition or order , That is, a string of numbers can be divided into two parts , Part of the ascending order or repetition , The other part is also ascending or repeating .