75.Find Peak Element

class Solution {
/**
 * @param A: An integers array.
 * @return: return any of peek positions.
 */
public int findPeak(int[] A) {
    // write your code here
    int length = A.length;
    int start = 1;
    int end = length - 2;
    while (start + 1 < end) {
        int mid = start + (end - start) / 2;
        if (A[mid] > A[mid + 1] && A[mid] > A[mid - 1]) return mid;
        else if (A[mid] < A[mid + 1] && A[mid] > A[mid - 1]) start = mid;
        else end = mid;
    }
    if (A[start] > A[end]) return start;
    else return end;
}
}