week6 唯一路径

70works/week6/unique_paths.cpp

+class Solution {
+public:
+    int uniquePaths(int m, int n) {
+        int **dp = new int * [m+1];
+        for(int i =0; i <= m; i++) {
+            dp[i] = new int [n+1];
+        }
+        for(int i =1; i<=m; i++) {
+            for(int j =1; j<=n;j++) {
+                if (i == 1 || j == 1) {
+                    dp[i][j] =1;
+                } else {
+                dp[i][j] = dp[i-1][j] + dp[i][j-1];
+                }
+            }
+        }
+        int res = dp[m][n];
+        for(int i=1; i <= m; i++)
+        {
+        delete []dp[i];
+        }
+        delete[]dp;
+        return res;
+    }
+};
\ No newline at end of file