LC-0978 Medium LeetCode

978. Longest Turbulent Subarray

Array Dynamic Programming Sliding Window

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 48% Topics: Array, Dynamic Programming, Sliding Window

Reading material

Arrays & Hashing 12 min 1-D Dynamic Programming 16 min Sliding Window 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def maxTurbulenceSize(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        result = 1
        start = 0
        for i in xrange(1, len(A)):
            if i == len(A)-1 or \
               cmp(A[i-1], A[i]) * cmp(A[i], A[i+1]) != -1:
                result = max(result, i-start+1)
                start = i
        return result

Solution from kamyu104/LeetCode-Solutions · MIT