【发布时间】:2015-09-14 00:51:38
【问题描述】:
我正在尝试解决一个面试问题:
给定一个 n*n 矩阵,假设您从左上角的单元格(即 0,0)开始。您可以向右或向下移动,并且您必须前往右下角的单元格。获取小于给定值的最大值。例如,假设 3*3 矩阵,给定值为
5。
0 1 2
2 1 2
3 2 1
optimal path is 0 -> 1 -> 1 -> 2 -> 1 = 5
我开始使用递归进行编码,但答案不正确。有什么建议吗?
def findAllPaths(currX, currY, path, grid, sum):
#print currX, currY
if currX == len(grid)-1:
i = currY
temp = 0
while i < len(grid):
path = path + str(grid[currX][i])
temp += grid[currX][i]
i += 1
sum.append(temp)
#print 'first loop', sum, path
return
if currY == len(grid)-1:
i = currX
temp = 0
while i < len(grid):
path = path + str(grid[i][currY])
temp += grid[i][currY]
i += 1
sum.append(temp)
#print 'second loop', sum, path
return
#print currX, currY
#path = path + str(grid[currX][currY])
findAllPaths(currX+1,currY,path,grid, sum)
findAllPaths(currX, currY+1,path,grid, sum)
return sum
【问题讨论】: