Leetcode 1547. Minimum Cost to Cut a Stick [Python]

记忆化搜索的办法。按照提示，问题最终是求0和n之间的cut的cost最小值。因此，问题转化为求0到k和k到n之间，两个cut的最小值和。

class Solution:
    def minCost(self, n: int, cuts: List[int]) -> int:
        cuts.sort()
        cuts = [0]+cuts+[n]
        memo = {}
        def helper(cut_start, cut_end):
            if cut_start + 1 >= cut_end:return 0
            if (cut_start, cut_end) in memo:return memo[(cut_start, cut_end)]
            res = float('inf')
            for k in range(cut_start+1, cut_end):
                cost = helper(cut_start, k) + helper(k, cut_end) + (cuts[cut_end]-cuts[cut_start])
                res = min(cost, res)
            memo[(cut_start, cut_end)] = res   
            return res
        return helper(0, len(cuts)-1)

进一步转化为DP：

class Solution:
    def minCost(self, n: int, cuts: List[int]) -> int:
        cuts.sort()
        cuts = [0]+cuts+[n]
        m = len(cuts)
        dp = [[None for _ in range(m)] for _ in range(m)]
        for distance in range(1, m+1):
            for i in range(m-distance+1):
                j = i + distance -1
                if i + 1 >= j:
                    dp[i][j] = 0
                    continue
                res = float('inf')
                for k in range(i+1,j):
                    cost = dp[i][k] + dp[k][j] + cuts[j]-cuts[i]
                    res = min(cost, res)
                dp[i][j] = res
        return dp[0][m-1]