LC.P162[寻找峰值]

方法一：二分

1
2
3
4
5
6
7
8
9
10
11
class Solution {
    public int findPeakElement(int[] nums) {
        int left = 0, right = nums.length - 1;
        while (left < right) {
            int mid = left + right >>> 1;
            if (nums[mid] > nums[mid + 1]) right = mid;
            else left = mid + 1;
        }
        return right;
    }
}
  • 时间复杂度：$O(logn)$
  • 空间复杂度：$O(1)$