11

Author: Mr-wang-1

coinsCollection.py

@@ -0,0 +1,29 @@
+def coinsCollection(board):
+    result = board
+    m = len(board)  # hang
+    n = len(board[0])  # lie
+    for i in range(1, m):
+        for j in range(0, n):
+            result[i][j] = max(result[i-1][j], result[i][j-1])+board[i][j]
+    return max(result[-1])      
+
+# def coinsRoad(selfroad):
+#     road = board
+#     while(m>=0 and n>=0):
+#         if road[m-1][n] ==road[m][n-1]:
+#             road[i-1][j] = 1
+#             road[i][j-1] = 0
+#             i = i-1
+#             j= j-1
+#         elif road[i-1][j]>road[i][j-1]:
+#             road[i-1][j] = 0
+#         elif road[i-1][j]<road[i][j-1]:
+#             road[i][j-1] = 1
+#             j = j-1
+#     return road
+
+board = [[0, 0, 0, 0, 1, 0 ], [0,1,0,1,0,0], [
+    0,0,0,1,0,1], [0,0,1,0,0,1], [1,0,0,0,1,0]]
+print(coinsCollection(board))
+
+

coinsRoad.py

@@ -0,0 +1,23 @@
+
+def coinsRoad(result):
+    import numpy as np
+    road = a=np.zeros((5,6))
+    i = len(f)-1
+    j =len(f[0])-1
+
+    while(j>=0 and i>=0):
+        if f[i-1][j]==f[i][j-1]:
+            road[i-1][j] = 1
+            road[i][j-1] = 1
+            i = i-1
+            j = j-1
+        elif f[i-1][j]>f[i][j-1]:
+            road[i-1][j] = 1
+            i = i-1
+        elif f[i-1][j]<f[i][j-1]:
+            road[i][j-1] = 1
+            j = j-1
+    print(road)
+f = [[0, 0, 0, 0, 1, 0], [0, 1, 1, 2, 2, 2], [
+        0, 1, 1, 3, 3, 4], [0, 1, 2, 3, 3, 5], [1, 1, 2, 3, 4, 5]]
+print(coinsRoad(f))