Find Peak Element

Find Peak Element

给定数组，找到波峰。

There is an integer array which has the following features:

    * The numbers in adjacent positions are different.

    * A[0] < A[1] && A[A.length - 2] > A[A.length - 1]. 开始递增，末尾递减。

We define a position P is a peek if A[P] > A[P-1] && A[P] > A[P+1].

Find a peak element in this array. Return the index of the peak.

Note

The array may contains multiple peeks, find any of them.

Example

[1, 2, 1, 3, 4, 5, 7, 6]

return index 1 (which is number 2)  or 6 (which is number 7)

Solution:

    public int findPeak(int[] A) {
        if (A == null || A.length == 0) {
            return 0;
        }
        int start = 0;
        int end = A.length - 1;
        int mid = 0;
        while (start + 1 < end) {
            mid = start + ((end - start) >> 1);
            if (A[mid - 1] < A[mid] && A[mid] > A[mid + 1]) {
                break;
            } else if (A[mid - 1] < A[mid]) {
                start = mid;
            } else {
                end = mid;
            }
        }
        return mid;
    }

思路：

给定数组，最开始是单调递增，最后是单调递减。

处于递增时，后面一定有波峰。处于递减时，前面一定有波峰。

如果只找mid，则start 和 end 不要加减1。循环外一定要有return，所以先用了break。