力扣978最长湍流子数组——Python解答

我们采用DP解法

        up = [1] * len(arr)
        down = [1] * len(arr)
        ans = 1

        for i in range(1, len(arr)):
            if arr[i] > arr[i-1]:
                up[i] = down[i-1] + 1
            elif arr[i] < arr[i-1]:
                down[i] = up[i-1] + 1
            ans = max(ans, down[i], up[i])
        return ans