OfferWithLeetcodeJava/Solution11.java at master · leo-plus/OfferWithLeetcodeJava · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
class Solution {
    public int minArray(int[] numbers) {
        if (numbers.length == 1) {
            return numbers[0];
        }

        int left = 0;
        int right = numbers.length - 1;
        int mid = left;
        while (numbers[left] >= numbers[right]) {
            if (right - left == 1) {
                return numbers[right];
            }

            mid = (right + left) / 2;

            if (numbers[left] == numbers[right] && numbers[mid] == numbers[left]) {
                return findMin(numbers, left, right);
            }

            if (numbers[mid] >= numbers[left]) {
                left = mid;
            } else if (numbers[mid] <= numbers[right]) {
                right = mid;
            }

        }

        return numbers[mid];
    }

    private int findMin(int[] numbers, int left, int right) {
        int result = numbers[left];
        for (int i = left; i <= right; i++) {
            result = Math.min(result, numbers[i]);
        }

        return result;
    }
}