題目描述：

A subarray?A[i], A[i+1], ..., A[j]?of?A?is said to be?turbulent?if and only if:

• For?i <= k < j,?A[k] > A[k+1]?when?k?is odd, and?A[k] < A[k+1]?when?k?is even;
• OR, for?i <= k < j,?A[k] > A[k+1]?when?k?is even, and?A[k] < A[k+1]?when?k?is odd.

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

Return the?length?of a?maximum size turbulent subarray of A.

Example 1:

Input: [9,4,2,10,7,8,8,1,9] Output: 5 Explanation: (A[1] > A[2] < A[3] > A[4] < A[5])

Example 2:

Input: [4,8,12,16] Output: 2

Example 3:

Input: [100] Output: 1

Note:

1 <= A.length <= 40000

0 <= A[i] <= 10^9

class Solution { public:int maxTurbulenceSize(vector<int>& A) {int n=A.size();if(n<=1) return n;vector<int> low(n,0);vector<int> high(n,0);low[0]=1, high[0]=1;int max_length=1;for(int i=1;i<n;i++){if(A[i]>A[i-1]){high[i]=low[i-1]+1;low[i]=1;max_length=max(max_length, high[i]);}else if(A[i]<A[i-1]){low[i]=high[i-1]+1;high[i]=1;max_length=max(max_length, low[i]);}else high[i]=1, low[i]=1;}return max_length;} };

?

總結

以上是生活随笔為你收集整理的LeetCode #978. Longest Turbulent Subarray的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。