Package g1601_1700.s1648_sell_diminishing_valued_colored_balls

Class Solution

java.lang.Object
g1601_1700.s1648_sell_diminishing_valued_colored_balls.Solution
public class Solution extends Object
1648 - Sell Diminishing-Valued Colored Balls.<p>Medium</p> <p>You have an <code>inventory</code> of different colored balls, and there is a customer that wants <code>orders</code> balls of <strong>any</strong> color.</p> <p>The customer weirdly values the colored balls. Each colored ball&rsquo;s value is the number of balls **of that color **you currently have in your <code>inventory</code>. For example, if you own <code>6</code> yellow balls, the customer would pay <code>6</code> for the first yellow ball. After the transaction, there are only <code>5</code> yellow balls left, so the next yellow ball is then valued at <code>5</code> (i.e., the value of the balls decreases as you sell more to the customer).</p> <p>You are given an integer array, <code>inventory</code>, where <code>inventory[i]</code> represents the number of balls of the <code>i<sup>th</sup></code> color that you initially own. You are also given an integer <code>orders</code>, which represents the total number of balls that the customer wants. You can sell the balls <strong>in any order</strong>.</p> <p>Return <em>the <strong>maximum</strong> total value that you can attain after selling</em> <code>orders</code> <em>colored balls</em>. As the answer may be too large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/11/05/jj.gif" alt="" /></p> <p><strong>Input:</strong> inventory = [2,5], orders = 4</p> <p><strong>Output:</strong> 14</p> <p><strong>Explanation:</strong> Sell the 1st color 1 time (2) and the 2nd color 3 times (5 + 4 + 3). The maximum total value is 2 + 5 + 4 + 3 = 14.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> inventory = [3,5], orders = 6</p> <p><strong>Output:</strong> 19</p> <p><strong>Explanation:</strong> Sell the 1st color 2 times (3 + 2) and the 2nd color 4 times (5 + 4 + 3 + 2). The maximum total value is 3 + 2 + 5 + 4 + 3 + 2 = 19.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= inventory.length <= 10<sup>5</sup></code></li> <li><code>1 <= inventory[i] <= 10<sup>9</sup></code></li> <li><code>1 <= orders <= min(sum(inventory[i]), 10<sup>9</sup>)</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maxProfit

      public int maxProfit(int[] inventory, int orders)