leetcode-javascript/solutions/0978-longest-turbulent-subarray.js at development · Anuj9826/leetcode-javascript · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/**
 * Longest Turbulent Subarray
 * Time Complexity: O(N)
 * Space Complexity: O(1)
 */
var maxTurbulenceSize = function (inputElements) {
  if (inputElements.length < 2) {
    return inputElements.length;
  }

  let longestSubarrayLength = 1;
  let currentTurbulenceAscending = 1;
  let currentTurbulenceDescending = 1;

  for (let arrayIndex = 1; arrayIndex < inputElements.length; arrayIndex++) {
    const previousAscendingValue = currentTurbulenceAscending;
    const previousDescendingValue = currentTurbulenceDescending;

    if (inputElements[arrayIndex] === inputElements[arrayIndex - 1]) {
      currentTurbulenceAscending = 1;
      currentTurbulenceDescending = 1;
    } else {
      if (inputElements[arrayIndex] > inputElements[arrayIndex - 1]) {
        currentTurbulenceAscending = previousDescendingValue + 1;
        currentTurbulenceDescending = 1;
      } else {
        currentTurbulenceDescending = previousAscendingValue + 1;
        currentTurbulenceAscending = 1;
      }
    }
    longestSubarrayLength = Math.max(
      longestSubarrayLength,
      currentTurbulenceAscending,
      currentTurbulenceDescending,
    );
  }

  return longestSubarrayLength;
};