《LeetCode力扣练习》代码随想录——贪心算法(摆动序列—Java)
刷题思路来源于 代码随想录
376. 摆动序列
-
贪心
class Solution { public int wiggleMaxLength(int[] nums) { if (nums.length == 1) { return 1; } int result = 1; int pre = 0; int post = 0; for (int i = 0; i < nums.length - 1; i++) { post = nums[i] - nums[i + 1]; if ((pre <= 0 && post > 0) || (pre >= 0 && post < 0)) { result++; pre = post; } } return result; } }