162. Find Peak Element (Medium)

https://leetcode.com/problems/find-peak-element/

A peak element is an element that is greater than its neighbors.

Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.

The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.

You may imagine that nums[-1] = nums[n] = -∞.

Example 1:

Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.

Example 2:

Input: nums = [1,2,1,3,5,6,4]
Output: 1 or 5 
Explanation: Your function can return either index number 1 where the peak element is 2, 
             or index number 5 where the peak element is 6.

Note:

Your solution should be in logarithmic complexity.

Solutions

class Solution {
    public int findPeakElement(int[] nums) {
        int size = nums.length;
        if (size <= 1) {
            return 0;
        }

        // Only one peak index will be sufficient to meets the requirement.
        // Following trick helps to fasten the searching if peaks exists at corner.
        if (nums[0] > nums[1]) {
            return 0;
        } else if (nums[size - 2] < nums[size - 1]) {
            return size - 1;
        }

        int i;
        for (i = 1; i < nums.length - 1; i++) {
            if (nums[i - 1] < nums[i] && nums[i] > nums[i + 1]) {
                break;
            }
        }

        return i;
    }
}

Incorrect Solutions

References

Copyright © iovi.com 2017 all right reserved,powered by GitbookLast Modification: 2019-12-03 11:01:18

results matching ""

    No results matching ""