package leetcode;

/**
 * https://leetcode.com/problems/longest-mountain-in-array/
 */
public class Problem845 {
    public int longestMountain(int[] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem845 prob = new Problem845();
    }
}

@@ -278,16 +278,178 @@
 m845();%0A
+        System.out.println(prob.longestMountain(new int%5B%5D%7B2, 1, 4, 7, 3, 2, 5%7D)); // 5%0A        System.out.println(prob.longestMountain(new int%5B%5D%7B2, 2, 2%7D)); // 0%0A
     %7D%0A%7D%0A

Update problem 845