Minimum Falling Path Sum
题目描述
本题目链接:931. Minimum Falling Path Sum
Given a square array of integers A
, we want the minimum sum of a falling paththrough A
.
A falling path starts at any element in the first row, and chooses one element from each row. The next row’s choice must be in a column that is different from the previous row’s column by at most one.