LC-2312 Hard LeetCode

2312. Selling Pieces of Wood

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 52% Topics: Array, Dynamic Programming, Memoization

Reading material

Arrays & Hashing 12 min 1-D Dynamic Programming 16 min

Reference solution (spoiler · python)

# Time:  O(m * n * (m + n))
# Space: O(m * n)

# dp
class Solution(object):
    def sellingWood(self, m, n, prices):
        """
        :type m: int
        :type n: int
        :type prices: List[List[int]]
        :rtype: int
        """
        dp = [[0]*(n+1) for i in xrange(m+1)]
        for h, w, p in prices:
            dp[h][w] = p
        for i in xrange(1, m+1):
            for j in xrange(1, n+1):
                for k in xrange(1, i//2+1):
                    dp[i][j] = max(dp[i][j], dp[k][j]+dp[i-k][j])
                for k in xrange(1, j//2+1):
                    dp[i][j] = max(dp[i][j], dp[i][k]+dp[i][j-k])
        return dp[m][n]

Solution from kamyu104/LeetCode-Solutions · MIT