给定一个方形整数数组 A
,我们想要得到通过 A
的下降路径的最小和。
下降路径可以从第一行中的任何元素开始,并从每一行中选择一个元素。在下一行选择的元素和当前行所选元素最多相隔一列。
示例:
输入:[[1,2,3],[4,5,6],[7,8,9]]
输出:12
解释:
可能的下降路径有:
[1,4,7], [1,4,8], [1,5,7], [1,5,8], [1,5,9]
[2,4,7], [2,4,8], [2,5,7], [2,5,8], [2,5,9], [2,6,8], [2,6,9]
[3,5,7], [3,5,8], [3,5,9], [3,6,8], [3,6,9]
和最小的下降路径是 [1,4,7]
,所以答案是 12
。
提示:
1 <= A.length == A[0].length <= 100
-100 <= A[i][j] <= 100
思路:
动态规划。
第一行照抄原数组,其他dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1], dp[i - 1][j + 1]) + A[i][j],如果是边界就去掉min括号里不存在的项。
class Solution(object):
def minFallingPathSum(self, A):
"""
:type A: List[List[int]]
:rtype: int
"""
m = len(A)
n = m
if A == [[]]:
return 0
dp = [[0 for _ in range(n)] for t in range(m)]
for i in range(n):
dp[0][i] = A[0][i]
for i in range(1, m):
for j in range(n):
if not j: # the first column
if j + 1 <= n - 1: # j + 1 column exists
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + 1]) + A[i][j]
else: # only 1 column exists
dp[i][j] = dp[i - 1][j] + A[i][j]
elif j == n - 1: # the last column
if j - 1 >= 0: # j -1 column exists
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1]) + A[i][j]
else: # only 1 column
dp[i][j] = dp[i - 1][j] + A[i][j]
else:
# if j + 1 < n - 1 and j - 1 >= 0:
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1], dp[i - 1][j + 1]) + A[i][j]
# print dp
return min(dp[-1])
优化版:
发现不需要考虑只有一列的情况,因为如果m = 1不会进入嵌套循环,所以可以减少逻辑判断。
class Solution(object):
def minFallingPathSum(self, A):
"""
:type A: List[List[int]]
:rtype: int
"""
m = len(A)
n = m
if A == [[]]:
return 0
dp = [[0 for _ in range(n)] for t in range(m)]
for i in range(n):
dp[0][i] = A[0][i]
for i in range(1, m):
for j in range(n):
if not j: # the first column
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + 1]) + A[i][j]
elif j == n - 1: # the last column
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1]) + A[i][j]
else:
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1], dp[i - 1][j + 1]) + A[i][j]
return min(dp[-1])