Package g2301_2400.s2312_selling_pieces_of_wood

Class Solution

java.lang.Object

g2301_2400.s2312_selling_pieces_of_wood.Solution

public class Solution
extends Object

2312 - Selling Pieces of Wood.<p>Hard</p> <p>You are given two integers <code>m</code> and <code>n</code> that represent the height and width of a rectangular piece of wood. You are also given a 2D integer array <code>prices</code>, where <code>prices[i] = [h_i, w_i, price_i]</code> indicates you can sell a rectangular piece of wood of height <code>h_i</code> and width <code>w_i</code> for <code>price_i</code> dollars.</p> <p>To cut a piece of wood, you must make a vertical or horizontal cut across the <strong>entire</strong> height or width of the piece to split it into two smaller pieces. After cutting a piece of wood into some number of smaller pieces, you can sell pieces according to <code>prices</code>. You may sell multiple pieces of the same shape, and you do not have to sell all the shapes. The grain of the wood makes a difference, so you <strong>cannot</strong> rotate a piece to swap its height and width.</p> <p>Return <em>the <strong>maximum</strong> money you can earn after cutting an</em> <code>m x n</code> <em>piece of wood</em>.</p> <p>Note that you can cut the piece of wood as many times as you want.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/04/27/ex1.png" alt="" /></p> <p><strong>Input:</strong> m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]</p> <p><strong>Output:</strong> 19</p> <p><strong>Explanation:</strong> The diagram above shows a possible scenario. It consists of:</p> <ul> <li> <p>2 pieces of wood shaped 2 x 2, selling for a price of 2 * 7 = 14.</p> </li> <li> <p>1 piece of wood shaped 2 x 1, selling for a price of 1 * 3 = 3.</p> </li> <li> <p>1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.</p> </li> </ul> <p>This obtains a total of 14 + 3 + 2 = 19 money earned.</p> <p>It can be shown that 19 is the maximum amount of money that can be earned.</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/04/27/ex2new.png" alt="" /></p> <p><strong>Input:</strong> m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]</p> <p><strong>Output:</strong> 32</p> <p><strong>Explanation:</strong> The diagram above shows a possible scenario. It consists of:</p> <ul> <li> <p>3 pieces of wood shaped 3 x 2, selling for a price of 3 * 10 = 30.</p> </li> <li> <p>1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.</p> </li> </ul> <p>This obtains a total of 30 + 2 = 32 money earned.</p> <p>It can be shown that 32 is the maximum amount of money that can be earned.</p> <p>Notice that we cannot rotate the 1 x 4 piece of wood to obtain a 4 x 1 piece of wood.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= m, n <= 200</code></li> <li><code>1 <= prices.length <= 2 * 10⁴</code></li> <li><code>prices[i].length == 3</code></li> <li><code>1 <= h_i <= m</code></li> <li><code>1 <= w_i <= n</code></li> <li><code>1 <= price_i <= 10⁶</code></li> <li>All the shapes of wood <code>(h_i, w_i)</code> are pairwise <strong>distinct</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
long	sellingWood(int m, int n, int[][] prices)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

sellingWood

public long sellingWood(int m,
 int n,
 int[][] prices)