★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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.

Example 1:

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

Input: [1,17,5,10,13,15,10,5,16,8]
Output: 7
Explanation: 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

输入: [1,7,4,9,2,5]
输出: 6 
解释: 整个序列均为摆动序列。

输入: [1,17,5,10,13,15,10,5,16,8]
输出: 7
解释: 这个序列包含几个长度为 7 摆动序列，其中一个可为[1,17,10,13,10,16,8]。

输入: [1,2,3,4,5,6,7,8,9]
输出: 2

 1 class Solution {
 2     func wiggleMaxLength(_ nums: [Int]) -> Int {
 3         if nums.isEmpty {return 0}
 4         var p:Int = 1
 5         var q:Int = 1
 6         var n:Int = nums.count
 7         for i in 1..<n
 8         {
 9             if nums[i] > nums[i - 1]
10             {
11                 p = q + 1
12             }
13             else if nums[i] < nums[i - 1]
14             {
15                 q = p + 1
16             }
17         }
18         return min(n, max(p, q))
19     }
20 }

 1 class Solution {
 2     func wiggleMaxLength(_ nums: [Int]) -> Int {
 3 
 4         guard nums.count > 0 else { return 0 }
 5         var n = nums.count
 6         var p = Array(repeating: 1, count: n)
 7         var q = Array(repeating: 1, count: n)
 8         for i in 1..<n {
 9             for j in 0..<i {
10                 if nums[i] < nums[j] { q[i] = max(q[i], p[j]+1)}
11                 else if nums[i] > nums[j] { p[i] = max(p[i], q[j]+1)}
12             }
13         }
14         return max(q.last!, p.last!)
15     }    
16 }