Java实现-寻找峰值

class Solution {    /**     * @param A: An integers array.     * @return: return any of peek positions.     */    public int findPeak(int[] A) {        // write your code here        if(A.length==0){return 0;}int result=0;for(int i=1;i<A.length-1;i++){if(A[i]>A[i-1]&&A[i]>A[i+1]){result=i;break;}}return result;    }}