We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 21f45d2 commit eb08b08Copy full SHA for eb08b08
Python/minimum-cost-for-cutting-cake-i.py
@@ -74,6 +74,6 @@ def memoization(x1, y1, x2, y2):
74
lookup[x1][y1][x2][y2] = mn
75
return lookup[x1][y1][x2][y2]
76
77
- lookup = [[[[-1]*n for _ in range(m)]for _ in range(n)]for _ in range(m)]
+ lookup = [[[[-1]*n for _ in range(m)]for _ in range(n)] for _ in range(m)]
78
return memoization(0, 0, m-1, n-1)
79
0 commit comments