LeetCode 376. Wiggle Subsequence（摇摆子序列）

最新推荐文章于 2024-01-23 19:45:02 发布

jmspan

最新推荐文章于 2024-01-23 19:45:02 发布

阅读量1.4k

点赞数

分类专栏：摇摆子序列波段动态规划困难奇葩文章标签： leetcode

本文链接：https://blog.csdn.net/jmspan/article/details/51991080

版权

动态规划同时被 3 个专栏收录

63 篇文章 0 订阅

订阅专栏

困难

37 篇文章 0 订阅

订阅专栏

奇葩

9 篇文章 0 订阅

订阅专栏

本文介绍了LeetCode第376题——摇摆子序列的解题思路。一个摇摆序列的特点是连续数之间的差值交替为正负。文章探讨了如何找到给定序列中最长的摇摆子序列的长度，并提出了两种解题方法，包括及时改变方向的策略和记录最近增减状态的方法。

摘要由CSDN通过智能技术生成

原题网址：https://leetcode.com/problems/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?

方法：原则是能够改变方向的尽早改变方向。

public class Solution {
    public int wiggleMaxLength(int[] nums) {
        if (nums == null) return 0;
        if (nums.length < 2) return nums.length;
        int max = nums[0], min = nums[0];
        int maxCount = 1, minCount = 1;
        int maxLength = 1;
        for(int i = 1; i < nums.length; i++) {
            if (max < nums[i]) {
                max = nums[i];
                maxCount = Math.max(maxCount, minCount + 1);
            } else if (min < nums[i] && nums[i] == max) {
                maxCount = Math.max(maxCount, minCount + 1);
            } else if (min < nums[i] && nums[i] < max) {
                max = min = nums[i];
                int nMaxCount = Math.max(maxCount, minCount + 1);
                int nMinCount = Math.max(minCount, maxCount + 1);
                maxCount = nMaxCount;
                minCount = nMinCount;
            } else if (min == nums[i] && nums[i] < max) {
                minCount = Math.max(minCount, maxCount + 1);
            } else if (min > nums[i]) {
                min = nums[i];
                minCount = Math.max(minCount, maxCount + 1);
            }
            maxLength = Math.max(maxLength, maxCount);
            maxLength = Math.max(maxLength, minCount);
        }
        return maxLength;
    }
}

方法二：保存最近一次增减的状态。

public class Solution {
    public int wiggleMaxLength(int[] nums) {
        if (nums == null || nums.length == 0) return 0;
        boolean up = false, down = false;
        int max = 1;
        int prev = nums[0];
        for(int i = 1; i < nums.length; i++) {
            if (nums[i] > prev && (down || !up)) {
                prev = nums[i];
                up = true;
                down = false;
                max++;
            } else if (nums[i] < prev && (up || !down)) {
                prev = nums[i];
                down = true;
                up = false;
                max++;
            } else {
                prev = nums[i];
            }
        }
        return max;
    }
}