摘要:
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.
阅读全文
摘要:
>>> m, n = 3, 4 >>> grid = [[float('inf')] * n] * m >>> grid [[inf, inf, inf, inf], [inf, inf, inf, inf], [inf, inf, inf, inf]] >>> for j in range(n):
阅读全文