算法作业系列13——Wiggle Subsequence

算法作业系列13

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

Follow up:
Can you do it in O(n) time?

思路

看到动态规划的问题，就是从最优子结构出发，先别想那么大的，找到问题的特征，想想看需要用什么方法去表示出来，再从一个最基础的问题出发，想想怎么去慢慢扩展成大规模的问题；当然也有从大规模的问题出发，利用递归找出规模小一点问题的转化，从而归到最基础的问题。其实总感觉和贪心很像……
看这道题，其实我开始想复杂了，我思考的情况是，从最基础的出发，不断增加串的长度，对于每个新增的，考虑加与不加两种情况。然而这样的考虑的确多余了，因为对于当前位置来说，加无疑是比不加更好的，因此，应该为，计算到当前位置的最大长度，并记录是增大的还是减小的。
因此这里就要引入两个值来计算到当前位置的最长长度，同时保留下序列是增长的还是下降的。

参考代码

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