diff --git a/docs/notes/Leetcode 题解 - 动态规划.md b/docs/notes/Leetcode 题解 - 动态规划.md index 2e962394..89fde1d0 100644 --- a/docs/notes/Leetcode 题解 - 动态规划.md +++ b/docs/notes/Leetcode 题解 - 动态规划.md @@ -201,8 +201,6 @@ public int minPathSum(int[][] grid) {

-

- ```java public int uniquePaths(int m, int n) { int[] dp = new int[n]; diff --git a/notes/Leetcode 题解 - 动态规划.md b/notes/Leetcode 题解 - 动态规划.md index 2b879855..08980fe7 100644 --- a/notes/Leetcode 题解 - 动态规划.md +++ b/notes/Leetcode 题解 - 动态规划.md @@ -201,8 +201,6 @@ public int minPathSum(int[][] grid) {

-

- ```java public int uniquePaths(int m, int n) { int[] dp = new int[n];