dp 64

Author: tech-cow

Diff for: README.md

@@ -107,3 +107,9 @@ Success is like pregnancy, Everybody congratulates you but nobody knows how many
 |  #  | Title | Solution | Time | Space | Difficulty | Note|
 |-----|-------| -------- | ---- | ------|------------|-----|
 |70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/#/solutions)| [Python [Yu]](./dp/70.py) | _O(N)_| _O(1)_  | Easy| |
+
+
+## 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)|

Diff for: dp/64.py

@@ -0,0 +1,33 @@
+class Solution(object):
+    def minPathSum(self, grid):
+        """
+        :type grid: List[List[int]]
+        :rtype: int
+        """
+        #Edge
+        if not grid:
+            return
+
+        #Grid = [row][col]
+        r = len(grid)
+        c = len(grid[0])
+
+        #Create dp matrix
+        dp = [[0 for _ in xrange(c)] for _ in xrange(r)]
+
+        dp[0][0] = grid[0][0]
+
+        for i in xrange(1, r):
+            dp[i][0] = dp[i-1][0] + grid[i][0]
+
+        for i in xrange(1, c):
+            dp[0][i] = dp[0][i-1] + grid[0][i]
+
+        # The rest:
+        for i in xrange(1, r):
+            for j in xrange(1, c):
+                dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j]
+
+        return dp[-1][-1]
+
+            

Diff for: dp/show.md

@@ -0,0 +1,14 @@
+Grid  | |  | | |
+-----|-------| -------- | ---- |
+ | 1|2|3|4
+ |5|6|7|8
+ |10|1|3|9
+ |100|7|5|6
+
+
+DP  | |  | | |
+ -----|-------| -------- | ---- |
+  |1|3|6|10
+  |6|9|13|18
+  |16|10|13|24
+  |116|17|18|24

Diff for: try.py

@@ -1,4 +1,6 @@
-lst = [[0] * 3 for _ in xrange(2)]
-ret = ', '.join(str(x) for x in lst)
-print (str(lst))
-print ret
+n = 5
+arr = []
+for i in range(n):
+    print 1
+    for j in range(i):
+        print 5