Package g0901_1000.s0978_longest_turbulent_subarray

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    978 - Longest Turbulent Subarray.

    Medium

    Given an integer array arr, return the length of a maximum size turbulent subarray of arr.

    A subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray.

    More formally, a subarray [arr[i], arr[i + 1], ..., arr[j]] of arr is said to be turbulent if and only if:

    • For i <= k < j:

    • Or, for i <= k < j:

    Example 1:

    Input: arr = 9,4,2,10,7,8,8,1,9

    Output: 5

    Explanation: arr1> arr2< arr3> arr4< arr5

    Example 2:

    Input: arr = 4,8,12,16

    Output: 2

    Example 3:

    Input: arr = 100

    Output: 1

    Constraints:

    • <code>1 <= arr.length <= 4 * 10<sup>4</sup></code>

    • <code>0 <= arri<= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxTurbulenceSize(IntArray arr)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait