dp 62

Author: tech-cow

README.md

@@ -112,6 +112,6 @@ Success is like pregnancy, Everybody congratulates you but nobody knows how many
 ## Dynamic Programming Medium
 |  #  | Title | Solution | Time | Space | Difficulty | Note|
 |-----|-------| -------- | ---- | ------|------------|-----|
-|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/#/submissions/1)| [Python [Yu]](./dp/64.py) | _O(N^2)_| _O(M*N)_  | Easy| [公瑾讲解](https://youtu.be/bEcW6QqgXvM)|
+|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/#/submissions/1)| [Python [Yu]](./dp/64.py) | _O(N^2)_| _O(M*N)_  | Medium| [公瑾讲解](https://youtu.be/bEcW6QqgXvM)|
 |62|[Unique Paths](https://leetcode.com/problems/unique-paths/#/description
-)| [Python [Yu]](./dp/62.py) | _O(N^2)_| _O(M*N)_  | Easy| Reference #64|
+)| [Python [Yu]](./dp/62.py) | _O(N^2)_| _O(M*N)_  | Medium| Reference #64|