算法分析与设计课程16——376. Wiggle Subsequence

一、题目——————原题链接

A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with fewer than two elements is trivially a wiggle sequence.

For example, [1,7,4,9,2,5] is a wiggle sequence because the differences (6,-3,5,-7,3) are alternately positive and negative. In contrast, [1,4,7,2,5] and [1,7,4,5,5] are not wiggle sequences, the first because its first two differences are positive and the second because its last difference is zero.

Given a sequence of integers, return the length of the longest subsequence that is a wiggle sequence. A subsequence is obtained by deleting some number of elements (eventually, also zero) from the original sequence, leaving the remaining elements in their original order.

Examples:

Input: [1,7,4,9,2,5]
Output: 6
The entire sequence is a wiggle sequence.

Input: [1,17,5,10,13,15,10,5,16,8]
Output: 7
There are several subsequences that achieve this length. One is [1,17,10,13,10,16,8].

Input: [1,2,3,4,5,6,7,8,9]
Output: 2

二、分析

据题，对于每连续的两个数，有两种可能
①min1,max1，此时min1的前面必须要为max2，max1后必须要为min2，即构成min2,min1,max1,max2；
②max1，min1，同理，构成min2,max1,min1,max2；

每个数组，我们都能按照以min开头或者以max开头，所以用result1记录以min开头的长度，用result2记录以max开头的结果长度。

当 num[i]>num[i-1] 时（min1,max1），由①result1=result2+1
当 num[i]

三、源代码

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        int size = nums.size();
        int result1 = 1, result2 = 1;
        for(int i = 1; i < size; i ++)
        {
            if(nums[i] > nums[i-1])
                result1 = result2 + 1;
            else if(nums[i] < nums[i-1])
                result2 = result1 + 1;
        }
        int max = 0;
        if(result1 < result2)
            max = result2;
        else
            max = result1;
        if(max < size)
            return max;
        else
            return size;
    }
};