Leetcode学习笔记：#852. Peak Index in a Mountain Array

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].

实现：

public int peakIndexInMountainArray(int[] A){
	for(int i = 1; i+1 < A.length;++i){
		if(A[i] > A[i+1])
			 return i;
	}
}

思路：
给出的数组前半部分是递增的，只要找出数组中下一位数比前一位小即可。