leetcode练习题(4)

376. Wiggle Subsequence

description:

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

解题思路：
应该算是贪心算法吧。因为这题需要找到最长的震荡的序列，故在原序列中，我们需要计算到每次震荡。如果是一串递增的序列，只需要取其中一个就好了，不会影响最终的结果。
大概像图中所示，红点是序列中的数，而我们只需要在递增递减的过程中每次选一个便可以找到最长的了。

#代码实现
class Solution:
    def wiggleMaxLength(self, nums):
        if len(nums) == 0: return 0
        mark = 0
        max_num = 0
        for i in range(0, len(nums) - 1):
            if nums[i] > nums[i + 1]:
                if mark == -1 or mark == 0:
                    max_num += 1
                mark = 1
            elif nums[i] < nums[i + 1]:
                if mark == 1 or mark == 0:
                    max_num += 1
                mark = -1
        return max_num + 1

//一种更简洁的写法
class Solution {
public:
    int wiggleMaxLength(nums) {
        size = len(nums), f=1, d=1;
        for i in range(0, size):
            if(nums[i]>nums[i-1]): 
                f=d+1;
            elif(nums[i]<nums[i-1]):
                d=f+1;
        return min(size, max(f, d));
    }
};