162. Find Peak Element

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

Given an input array where num[i] ≠ num[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 num[-1] = num[n] = -∞.

For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.

click to show spoilers.

Note:Your solution should be in logarithmic complexity.

class Solution {
    public int findPeakElement(int[] nums) {
        if(nums.length ==1 ){return 0;}
        int i = 1;
        while(i != nums.length-1){
            if(nums[i-1] < nums[i] && nums[i] > nums[i+1]){
                return i;
            }
            i++;
        }
        if(nums[i]>nums[i-1]){
            return i;
        }
        return 0;
    }
}
如果喜欢本文,给个好评呗!
[参与人数: 0 平均分: 0/5]

订阅可以第一时间收到文章更新通知哟~

发表评论

电子邮件地址不会被公开。