Leetcode978（力扣978）：最长湍流子数组

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