【Java】【LeetCode】162. 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.

题解：

二分法, 如何判断接下来应该找左边还是右边呢。依据其实是比较nums[m] 和 nums[m+1], 若是nums[m] < nums[m+1], peak 一定会出现在mid 右边，不包括mid.

反之peak 就会出现在mid 左边, 但要包括mid.

Time Complexity: O(logn). Space: O(1).

AC Java:

public class FindPeakElement
{

    public static void main(String[] args)
    {
        /**
         * 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] = -∞.
         */
        /**
         * Note:
         * 
         * Your solution should be in logarithmic complexity.
         */
        /**
         * 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.
         */
        int[] nums1 = { 1, 2, 3, 1 };
        System.out.println(findPeakElement(nums1));
        /**
         * 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.
         */
        int[] nums2 = { 1, 2, 1, 3, 5, 6, 4 };
        System.out.println(findPeakElement(nums2));
    }

    public static int findPeakElement(int[] nums)
    {
        if (nums == null || nums.length == 0)
        {
            return -1;
        }
        int low = 0, high = nums.length - 1;
        while (low < high)
        {
            int mid = (low + high) / 2;
            if (nums[mid] < nums[mid + 1])
            {
                low = mid + 1;
            }
            else
            {
                high = mid;
            }
        }
        return high;
    }

}