Leetcode 376. 摆动序列(DAY 43) ---- 动态规划学习期

原题题目

在这里插入图片描述



代码实现(首刷自解)

int wiggleMaxLength(int* nums, int numsSize){
    
    
    if(!numsSize)   return 0;
    int i,max = 1,positive = 1,negative = 1;
    for(i=0;i<numsSize;i++)
    {
    
    
        if(i) 
        {
    
    
            if(nums[i] > nums[i-1])
                positive = negative + 1;
            else if (nums[i] < nums[i-1])
                negative = positive + 1;
            if(positive > max)  max = positive;
            if(negative > max)  max = negative;
        }
    }
    return max;
}

猜你喜欢

转载自blog.csdn.net/qq_37500516/article/details/113768620