首页 > itarticle > 162. find peak element

162. find peak element

admin 11月 15, 2020 0

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:

1
2
3
 
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:

1
2
3
4
 
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.
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 
class  {
    public int findPeakElement(int[] array) {
        if (array == null || array.length == 0) {
               return -1;
          }
            int lb = 0;
         int ub = array.length - 1;
          while (lb + 1 < ub) {
                int mid = lb + (ub - lb) / 2;
               if (array[mid] < array[mid + 1]) {
                   lb = mid;
                } else if (array[mid] < array[mid - 1]) {
                   ub = mid;
                } else {
                    return mid;
             }
            }
            return array[lb] > array[ub]?lb:ub;
    }
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能