g0801_0900.s0845_longest_mountain_in_array.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0801_0900.s0845_longest_mountain_in_array;
// #Medium #Array #Dynamic_Programming #Two_Pointers #Enumeration
public class Solution {
public int longestMountain(int[] arr) {
int s = 0;
int i = 1;
while (i < arr.length - 1) {
if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) {
int j = i;
int tem = 1;
while (j > 0 && arr[j] > arr[j - 1]) {
j--;
tem++;
}
j = i;
while (j < arr.length - 1 && arr[j] > arr[j + 1]) {
j++;
tem++;
}
s = Math.max(s, tem);
i = j;
}
i++;
}
return s;
}
}