1289. Minimum Falling Path Sum II

Given a square grid of integers arr, a falling path with non-zero shifts is a choice of exactly one element from each row of arr, such that no two elements chosen in adjacent rows are in the same column.

Return the minimum sum of a falling path with non-zero shifts.

 

Example 1:

Input: arr = [[1,2,3],[4,5,6],[7,8,9]]
Output: 13
Explanation: 
The possible falling paths are:
[1,5,9], [1,5,7], [1,6,7], [1,6,8],
[2,4,8], [2,4,9], [2,6,7], [2,6,8],
[3,4,8], [3,4,9], [3,5,7], [3,5,9]
The falling path with the smallest sum is [1,5,7], so the answer is 13.

 

Constraints:

• 1 <= arr.length == arr[i].length <= 200
• -99 <= arr[i][j] <= 99

class Solution(object):
    def minFallingPathSum(self, arr):
        """
        :type arr: List[List[int]]
        :rtype: int
        """
        from collections import Counter
        n = len(arr)
        dp = arr[0]
        dp2 = [0] * n
        for i in range(1,n):
            d = Counter(dp)
            mi = min(dp)
            for j in range(n):
                if mi!=dp[j] or d[mi]>1:
                    dp2[j] = arr[i][j] + mi
                else:
                    dp2[j] = arr[i][j] + min([dp[k] for k in range(n) if k!=j])
            dp,dp2=dp2,dp
        return min(dp)

s=Solution()
print(s.minFallingPathSum([[1,2,3],[4,5,6],[7,8,9]]))