LeetCode-852. Peak Index in a Mountain Array

Let's call an array A a mountain if the following properties hold:

• A.length >= 3
• There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]

Given an array that is definitely a mountain, return any i such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1].

Example 1:

Input: [0,1,0]
Output: 1

Example 2:

Input: [0,2,1,0]
Output: 1

Note:

1. 3 <= A.length <= 10000
2. 0 <= A[i] <= 10^6
3. A is a mountain, as defined above.

题目：给定一个数组，先增后减，找到最大值对应的位置

思路：看到题目首先想到的是，挨个找，当有A[i-1]<A[i]>A[i+1]的时候，返回i就行了，写出代码如下：

class Solution {
public:
    int peakIndexInMountainArray(vector<int>& A) {
        int size = A.size();
        for(int i=1;i<size;i++){
        	if(A[i]>A[i-1]&&A[i]>A[i+1])
        		return i; 
		}
    }
};

可以AC，但只beats了7%，想也知道只遍历的话效率不高。

进一步用二分查找的方式，先从中间找，如果A[mid-1]<A[mid]>A[mid+1]，返回mid，如果A[mid-1]<A[mid]<A[mid+1]，则在右边继续查找，反之在左边继续查找。代码如下：

class Solution {
public:
    int peakIndexInMountainArray(vector<int>& A) {
        int left = 0;
        int right = A.size()-1;
        while(left<right){
        	int mid = (left+right)/2;
        	if(A[mid]>A[mid+1]&&A[mid]>A[mid-1])
        		return mid;
        	else if(A[mid-1]<A[mid]&&A[mid]<A[mid+1])
        		left = mid;//这里需要注意更新left为mid，而不是mid+1，因为是三个值，完全有可能mid+1是所求的最大值
			else 
				right = mid;	
		}
    }
};

AC ，beats 98%,，这就正常多了。