leetcode题解（162）Find Peak Element

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.

---

题解：
刚看题目的时候，感觉跟二叉查找树有点类似，其根节点就是我们要找的元素。后面再想想,有感觉不对。刚好最近又手撕一下快排，借鉴快排的思想，用两个指针i、j，分别指向数组首元素和尾元素。如果nums[i]

     public int findPeakElement(int[] nums) {
        if(nums.length == 1){
            return 0;
        }
        if(nums.length == 2){
            return nums[1] > nums[0] ? 1 : 0;
        }
        int i = 0;
        int j = nums.length-1;
        while(i<j){
            while(i<j && nums[i]<=nums[j]){
                i++;
            }
            while(i<j && nums[j]<=nums[i]){
                j--;
            }
        }
        return i;
    }