update 64

Author: geemaple

README.md

@@ -40,7 +40,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [✅] | [9c-dp.md](./list/9c-dp.md) | 42/45 | 3 vips |
 | [✅] | [geekbang.md](./list/geekbang.md) | 55/55 | - |
 | [✅] | [leetcode101.md](./list/leetcode101.md) | 183/184 | 1 vip |
-| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 46/94 | 9 vips |
+| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 49/94 | 10 vips |
 | [🔲] | [leetcode-contest.md](./list/leetcode-contest.md) | 10/40 | - |
 
 **Solved**: 438 problems

leetcode/64.minimum-path-sum.cpp

@@ -32,23 +32,23 @@
 class Solution {
 public:
     int minPathSum(vector<vector<int>>& grid) {
-        int m = grid.size();
-        int n = grid[0].size();
-        vector<vector<int>> dp(m, vector<int>(n, 0));
+        int n = grid.size();
+        int m = grid[0].size();
+        vector<vector<int>> dp(n, vector<int>(m, 0));
 
-        for (int i = 0; i < m; i++) {
-            for (int j = 0; j < n; j++) {
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < m; j++) {
                 if (i == 0 && j == 0) {
-                    dp[0][0] = grid[0][0];
+                    dp[0][0] = grid[i][j];
                 } else if (i == 0) {
-                    dp[0][j] = dp[0][j - 1] + grid[0][j];
+                    dp[0][j] = dp[i][j - 1] + grid[i][j];
                 } else if (j == 0) {
-                    dp[i][0] = dp[i - 1][0] + grid[i][0];
+                    dp[i][0] = dp[i - 1][j] + grid[i][j];
                 } else {
                     dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
                 }
             }
         }
-        return dp[m - 1][n - 1];
+        return dp[n - 1][m - 1];
     }
 };

leetcode/64.minimum-path-sum.py

@@ -31,19 +31,19 @@
 
 class Solution:
     def minPathSum(self, grid: List[List[int]]) -> int:
-        m = len(grid)
-        n = len(grid[0])
-        dp = [[0 for j in range(n)] for i in range(m)]
+        n = len(grid)
+        m = len(grid[0])
 
-        for i in range(m):
-            for j in range(n):
+        dp = [[0] * m for i in range(n)]
+        for i in range(n):
+            for j in range(m):
                 if i == 0 and j == 0:
-                    dp[0][0] = grid[0][0]
+                    dp[i][j] = grid[i][j]
                 elif i == 0:
-                    dp[0][j] = dp[0][j - 1] + grid[0][j]
+                    dp[i][j] = dp[i][j - 1] + grid[i][j]
                 elif j == 0:
-                    dp[i][0] = dp[i - 1][0] + grid[i][0]
+                    dp[i][j] = dp[i - 1][j] + grid[i][j]
                 else:
                     dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j]
 
-        return dp[m - 1][n - 1]
+        return dp[n - 1][m - 1]

lintcode/631.maximal-square-ii.vip

@@ -70,11 +70,11 @@
 54. https://leetcode.com/problems/house-robber-ii/
 55. https://leetcode.com/problems/climbing-stairs/
 56. https://www.lintcode.com/problem/fibonacci/
+57. https://leetcode.com/problems/maximal-square/
+58. https://www.lintcode.com/problem/maximal-square-ii/
+59. https://leetcode.com/problems/unique-paths/
+60. https://leetcode.com/problems/minimum-path-sum/
 
-- https://www.lintcode.com/problem/maximal-square/
-- https://www.lintcode.com/problem/maximal-square-ii/
-- https://www.lintcode.com/problem/unique-paths/
-- https://www.lintcode.com/problem/minimum-path-sum/
 - https://www.lintcode.com/problem/edit-distance/
 - https://www.lintcode.com/problem/longest-continuous-increasing-subsequence/
 - https://www.lintcode.com/problem/longest-continuous-increasing-subsequence-ii/