最長擺動子序列

376. Wiggle Subsequence (Medium)

題目描述：

給定一個數(shù)組，求出其最長擺動子序列

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

代碼：

public int wiggleMaxLength(int []nums){if(nums==null||nums.length==0)return 0;int up=1;int down=1;for(int i=1;i<nums.length;i++){if(nums[i]>nums[i-1]){up=down+1;}else if(nums[i]<nums[i-1]){down=up+1;}} return Math.max(up,down); }

轉(zhuǎn)載于:https://www.cnblogs.com/yjxyy/p/11119182.html

總結(jié)

以上是生活随笔為你收集整理的动态规划（最长递增子序列）---最长摆动子序列的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。