package com.fishercoder.solutions;

/**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:
 *
 * 3 <= A.length <= 10000
 * 0 <= A[i] <= 10^6
 * A is a mountain, as defined above.*/
public class _852 {
    public static class Solution1 {
        public int peakIndexInMountainArray(int[] A) {
            for (int i = 1; i < A.length - 1; i++) {
                if (A[i] > A[i + 1]) {
                    return i;
                }
            }
            return -1;
        }
    }
}

@@ -33,595 +33,8 @@
 s;%0A%0A
-/**852. Peak Index in a Mountain Array%0A *%0A * Let's call an array A a mountain if the following properties hold:%0A *%0A * A.length %3E= 3%0A * There exists some 0 %3C i %3C A.length - 1 such that A%5B0%5D %3C A%5B1%5D %3C ... A%5Bi-1%5D %3C A%5Bi%5D %3E A%5Bi+1%5D %3E ... %3E A%5BA.length - 1%5D%0A * Given an array that is definitely a mountain, return any i such that A%5B0%5D %3C A%5B1%5D %3C ... A%5Bi-1%5D %3C A%5Bi%5D %3E A%5Bi+1%5D %3E ... %3E A%5BA.length - 1%5D.%0A *%0A * Example 1:%0A *%0A * Input: %5B0,1,0%5D%0A * Output: 1%0A * Example 2:%0A *%0A * Input: %5B0,2,1,0%5D%0A * Output: 1%0A * Note:%0A *%0A * 3 %3C= A.length %3C= 10000%0A * 0 %3C= A%5Bi%5D %3C= 10%5E6%0A * A is a mountain, as defined above.*/%0A
 publ

refactor 852