Update 0045.跳跃游戏II.md

加入python-动态规划做法代码

problems/0045.跳跃游戏II.md

@@ -229,7 +229,19 @@ class Solution:
                 step += 1
         return step
 ```
+```python
+# 动态规划做法
+class Solution: 
+    def jump(self, nums: List[int]) -> int:
+        result = [10**4+1]*len(nums)
+        result[0]=0
+        for i in range(len(nums)):
+            for j in range(nums[i]+1):
+                if i+j<len(nums): result[i+j]=min(result[i+j],result[i]+1)
+        #print(result) #打印数组
+        return result[-1]
 
+```
 
 
 ### Go