标签：10 wiggle sequence positive differences Wiggle Subsequence nums 376

package LeetCode_376

/**
 * 376. Wiggle Subsequence
 * https://leetcode.com/problems/wiggle-subsequence/
 * 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,7,4,9,2,5]
Output: 6
Explanation: The entire sequence is a wiggle sequence with differences (6, -3, 5, -7, 3).

Example 2:
Input: nums = [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] with differences (16, -7, 3, -3, 6, -8).

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

Constraints:
1. 1 <= nums.length <= 1000
2. 0 <= nums[i] <= 1000
 * */
class Solution {
    /**
     * solution: keep checking current different and prev different (up or down),
     * because we can find out rule by [6, -3, 5, -7, 3] and [16, -7, 3, -3, 6, -8],
     * prev diff:0
     * current diff:6
     * then
     * prev diff:6
     * current diff:-3
     * then
     * ...
     * Time:O(n), Space:O(1)
     * */
    fun wiggleMaxLength(nums: IntArray): Int {
        val size = nums.size
        if (size == 1) {
            return 1
        }
        var count = 1
        var prevDiff = 0
        var diff = 0
        for (i in 1 until size) {
            diff = nums[i] - nums[i - 1]
            //keep tracking down or up
            if (diff > 0 && prevDiff <= 0 || diff < 0 && prevDiff >= 0) {
                count++
                prevDiff = diff
            }
        }
        return count
    }
}

标签：10,wiggle,sequence,positive,differences,Wiggle,Subsequence,nums,376
来源： https://www.cnblogs.com/johnnyzhao/p/15088061.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。