From 50b9753b647ace27caa0a1a31bd91975672db4d7 Mon Sep 17 00:00:00 2001
From: dcj_hp <294487055@qq.com>
Date: Wed, 20 Jul 2022 01:11:00 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200376.=E6=91=86=E5=8A=A8?=
 =?UTF-8?q?=E5=BA=8F=E5=88=97=20=20=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC(Python,=20C)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0376.摆动序列.md | 64 +++++++++++++++++++++++++++++++++++
 1 file changed, 64 insertions(+)

diff --git a/problems/0376.摆动序列.md b/problems/0376.摆动序列.md
index 70a62145..714dba57 100644
--- a/problems/0376.摆动序列.md
+++ b/problems/0376.摆动序列.md
@@ -228,6 +228,8 @@ class Solution {
 
 ### Python 
 
+**贪心**
+
 ```python
 class Solution:
     def wiggleMaxLength(self, nums: List[int]) -> int:
@@ -240,7 +242,30 @@ class Solution:
         return res
 ```
 
+**动态规划**
+
+```python
+class Solution:
+    def wiggleMaxLength(self, nums: List[int]) -> int:
+        # 0 i 作为波峰的最大长度
+        # 1 i 作为波谷的最大长度
+        # dp是一个列表，列表中每个元素是长度为 2 的列表
+        dp = []
+        for i in range(len(nums)):
+            # 初始为[1, 1]
+            dp.append([1, 1])
+            for j in range(i):
+                # nums[i] 为波谷
+                if nums[j] > nums[i]:
+                    dp[i][1] = max(dp[i][1], dp[j][0] + 1)
+                # nums[i] 为波峰 
+                if nums[j] < nums[i]:
+                    dp[i][0] = max(dp[i][0], dp[j][1] + 1)
+        return max(dp[-1][0], dp[-1][1])
+```
+
 ### Go 
+
 ```golang
 func wiggleMaxLength(nums []int) int {
     var count,preDiff,curDiff  int
@@ -324,6 +349,7 @@ impl Solution {
 
 ### C
 **贪心**
+
 ```c
 int wiggleMaxLength(int* nums, int numsSize){
     if(numsSize <= 1) 
@@ -349,6 +375,44 @@ int wiggleMaxLength(int* nums, int numsSize){
 }
 ```
 
+**动态规划**
+
+```c
+int max(int left, int right)
+{
+    return left > right ? left : right;
+}
+int wiggleMaxLength(int* nums, int numsSize){
+    if(numsSize <= 1)
+    {
+        return numsSize;
+    }
+    // 0   i 作为波峰的最大长度
+    // 1   i 作为波谷的最大长度
+    int dp[numsSize][2];
+    for(int i = 0; i < numsSize; i++)
+    {
+        dp[i][0] = 1;
+        dp[i][1] = 1;
+        for(int j = 0; j < i; j++)
+        {
+            // nums[i] 为山谷
+            if(nums[j] > nums[i])
+            {
+                dp[i][1] = max(dp[i][1], dp[j][0] + 1);
+            }
+            // nums[i] 为山峰
+            if(nums[j] < nums[i])
+            {
+                dp[i][0] = max(dp[i][0], dp[j][1] + 1);
+            }
+        }
+    }
+    return max(dp[numsSize - 1][0], dp[numsSize - 1][1]);
+}
+```
+
+
 
 ### TypeScript