您的位置 首页 JAVA(2017)

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]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《162. Find Peak Element》

发表评论

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

返回顶部