java.lang.Object
g1701_1800.s1798_maximum_number_of_consecutive_values_you_can_make.Solution

public class Solution extends Object
1798 - Maximum Number of Consecutive Values You Can Make.<p>Medium</p> <p>You are given an integer array <code>coins</code> of length <code>n</code> which represents the <code>n</code> coins that you own. The value of the <code>i<sup>th</sup></code> coin is <code>coins[i]</code>. You can <strong>make</strong> some value <code>x</code> if you can choose some of your <code>n</code> coins such that their values sum up to <code>x</code>.</p> <p>Return the <em>maximum number of consecutive integer values that you <strong>can</strong> <strong>make</strong> with your coins <strong>starting</strong> from and <strong>including</strong></em> <code>0</code>.</p> <p>Note that you may have multiple coins of the same value.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> coins = [1,3]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> You can make the following values:</p> <ul> <li> <p>0: take []</p> </li> <li> <p>1: take [1]</p> </li> </ul> <p>You can make 2 consecutive integer values starting from 0.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> coins = [1,1,1,4]</p> <p><strong>Output:</strong> 8</p> <p><strong>Explanation:</strong> You can make the following values:</p> <ul> <li> <p>0: take []</p> </li> <li> <p>1: take [1]</p> </li> <li> <p>2: take [1,1]</p> </li> <li> <p>3: take [1,1,1]</p> </li> <li> <p>4: take [4]</p> </li> <li> <p>5: take [4,1]</p> </li> <li> <p>6: take [4,1,1]</p> </li> <li> <p>7: take [4,1,1,1]</p> </li> </ul> <p>You can make 8 consecutive integer values starting from 0.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1,4,10,3,1]</p> <p><strong>Output:</strong> 20</p> <p><strong>Constraints:</strong></p> <ul> <li><code>coins.length == n</code></li> <li><code>1 <= n <= 4 * 10<sup>4</sup></code></li> <li><code>1 <= coins[i] <= 4 * 10<sup>4</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • getMaximumConsecutive

      public int getMaximumConsecutive(int[] coins)