Shulou(Shulou.com)06/01 Report--

This article mainly introduces how to achieve the longest turbulence subarray of leetcode. The introduction in this article is very detailed and has certain reference value. Interested friends must read it!

I. Content of the topic

When A[i], A[i+1],..., A[j] is called a turbulence subarray when it satisfies the following conditions:

If i A[k+1] and k is even, A[k]

A[2]

A[4] < A[5])

Example 2:

Input: [4, 8, 12, 16]

Output: 2

Example 3:

Input: [100]

Output: 1

Tip:

1

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.