LeetCode/Java/162.java at master · strengthen/LeetCode · 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
41
42
43
44
45
46
47
__________________________________________________________________________________________________
sample 0 ms submission
public class Solution {
    public int findPeakElement(int[] nums) {
        if (nums == null || nums.length == 0) {
            return -1;
        }
        int left = 0;
        int right = nums.length - 1;
        while (left < right) {
            int mid = (right - left) / 2 + left;
            if (nums[mid] < nums[mid + 1]) {
                left = mid + 1;
            } else {
                right = mid;
            }
        }
        return left;
    }
}
__________________________________________________________________________________________________
sample 34264 kb submission
class Solution {
    public int findPeakElement(int[] nums) {
        int l = 0;
        int r = nums.length - 1;

        while (l < r) {
            int mid = (l + r) / 2;

            int leftValue = mid <= 0 ? Integer.MIN_VALUE : nums[mid-1];
            int rightValue = mid >= nums.length - 1 ? Integer.MIN_VALUE : nums[mid+1];
            if (nums[mid] > leftValue && nums[mid] > rightValue) {
                return mid;
            }

            if (rightValue > nums[mid]) {
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }

        return l;
    }
}
__________________________________________________________________________________________________