g0901_1000.s0978_longest_turbulent_subarray.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0901_1000.s0978_longest_turbulent_subarray;
// #Medium #Array #Dynamic_Programming #Sliding_Window
// #2022_03_31_Time_7_ms_(48.10%)_Space_67.3_MB_(35.67%)
public class Solution {
public int maxTurbulenceSize(int[] arr) {
int n = arr.length;
int ans = 1;
int l;
int r;
if (n == 1) {
return 1;
}
if (n == 2) {
return arr[0] == arr[1] ? 1 : 2;
}
for (l = 0, r = 1; r < n - 1; r++) {
int difL = arr[r] - arr[r - 1];
int difR = arr[r] - arr[r + 1];
if (difL == 0 && difR == 0) {
l = r + 1;
} else if (difL == 0) {
ans = Math.max(ans, r - l);
l = r;
} else if (!((difL < 0 && difR < 0) || (difL > 0 && difR > 0))) {
ans = Math.max(ans, r - l + 1);
l = r;
}
}
return Math.max(ans, r - l + 1);
}
}