algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 07:35:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #958 from Tiffany-yuan/master

Browse Source 
update: 0376.摆动序列 js动态规划解法
This commit is contained in:
程序员Carl
2021-12-28 16:22:31 +08:00
committed by GitHub
parent 3fb3573489 0d6927a2d1
commit 1b80fe0867
1 changed files with 20 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
problems/0376.摆动序列.md
View File

@ -261,6 +261,7 @@ func wiggleMaxLength(nums []int) int {
```
### Javascript
**贪心**
```Javascript
var wiggleMaxLength = function(nums) {
if(nums.length <= 1) return nums.length
@ -277,6 +278,25 @@ var wiggleMaxLength = function(nums) {
return result
};
```
**动态规划**
```Javascript
var wiggleMaxLength = function(nums) {
if (nums.length === 1) return 1;
// 考虑前i个数，当第i个值作为峰谷时的情况（则第i-1是峰顶）
let down = 1;
// 考虑前i个数，当第i个值作为峰顶时的情况（则第i-1是峰谷）
let up = 1;
for (let i = 1; i < nums.length; i++) {
if (nums[i] < nums[i - 1]) {
down = Math.max(up + 1, down);
}
if (nums[i] > nums[i - 1]) {
up = Math.max(down + 1, up)
}
}
return Math.max(down, up);
};
```
-----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>