1 class Solution {
 2 public:
 3     /*
 4      * @param A: An integers array.
 5      * @return: return any of peek positions.
 6      */
 7     int findPeak(vector<int> &A) {
 8         if (A.empty()) {
 9             return -1;
10         }
11
12         int start = 0;
13         int end = A.size() - 1;
14
15         while (start + 1 < end) {
16             int mid = start + (end - start) / 2;
17
18             if (A[mid] > A[mid - 1]) {
19                 if (A[mid] > A[mid + 1]) {
20                     return mid;
21                 }
22                 else {
23                     start = mid;
24                 }
25             }
26             else {
27                 if (A[mid] > A[mid + 1]) {
28                     end = mid;
29                 }
30                 else {
31                     start = mid;
32                 }
33             }
34         }
35
36         return -1;
37     }
38 };

 1 class Solution {
 2     /**
 3      * @param A: An integers array.
 4      * @return: return any of peek positions.
 5      */
 6     public int findPeak(int[] A) {
 7         // write your code here
 8         int start = 1, end = A.length-2; // 1.答案在之间，2.不会出界
 9         while(start + 1 <  end) {
10             int mid = (start + end) / 2;
11             if(A[mid] < A[mid - 1]) {
12                 end = mid;
13             } else if(A[mid] < A[mid + 1]) {
14                 start = mid;
15             } else {
16                 end = mid;
17             }
18         }
19         if(A[start] < A[end]) {
20             return end;
21         } else {
22             return start;
23         }
24     }
25 }