# Leetcode 376 - Wiggle sub

`Note`

- DP is easier IMO
`dp[i][0]`

means a wiggle sub that ends with`nums[i]`

and`nums[i] < nums[i-1]`

`dp[i][1]`

means a wiggle sub that ends with`nums[i]`

and`nums[i] > nums[i-1]`

- The deduction is
1

2

3

4

5

6if (nums[i] > nums[j]) {

dp[i][1] = Math.max(dp[i][1], dp[j][0] + 1);

}

if (nums[i] < nums[j]) {

dp[i][0] = Math.max(dp[i][0], dp[j][1] + 1);

}

- Greeedy is not easy to come up with
- Take
`[1,2,3,1]`

for example,`1, 3, 1`

are top and bottoms, so we only need to eliminate`2`

on the way to the top. Same with eliminating`transition values`

on the way to a bottom. - Which means that we only need to calculate how many
`top`

and`bottom`

there are!

- Take

A `wiggle`

sequence is a sequence where 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 one element and a sequence with two non-equal elements are trivially wiggle sequences.

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

A subsequence is obtained by deleting some elements (possibly zero) from the original sequence, leaving the remaining elements in their original order.

Given an integer array nums, return the length of the longest wiggle subsequence of nums.

**Example**

1 | Input: nums = [1,17,5,10,13,15,10,5,16,8] |

** Greedy** O(n)

1 | /** |

** DP** O(n^2)

1 | /** |