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

Editor to share with you how to find the longest turbulence sub-array of leetcode, I believe that most people do not know much about it, so share this article for your reference, I hope you can learn a lot after reading this article, let's go to know it!

When the subarray A [I], A [ionization 1],..., A [j] of A satisfies the following conditions, we call it a turbulent subarray:

If I A [ku 1], and when k is even, A [k]

A [2]

A [4] < A [5])

Example 2:

Input: [4, 8, 12, 16]

Output: 2

Example 3:

Enter: [100]

Output: 1

Tip:

one

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.