@@ -0,0 +1,441 @@
+public class Solution %7B%0A    /**%0A     * @param A: An integers array.%0A     * @return: return any of peek positions.%0A     */%0A    public int findPeak(int%5B%5D A) %7B%0A        // write your code here%0A        int i = 1, j = A.length - 2;%0A        while (i %3C= j) %7B%0A            int m = (i + j) / 2;%0A            if (A%5Bm - 1%5D %3C A%5Bm%5D && A%5Bm%5D %3E A%5Bm + 1%5D) return m;%0A            if (A%5Bm - 1%5D %3C A%5Bm%5D) i = m + 1; else j = m - 1;%0A        %7D%0A        return i;%0A    %7D%0A%7D

add 75