leetcode-1798. Maximum Number of Consecutive Values You Can Make

题目

You are given an integer array coins of length n which represents the n coins that you own. The value of the ith coin is coins[i]. You can make some value x if you can choose some of your n coins such that their values sum up to x.

Return the maximum number of consecutive integer values that you can make with your coins starting from and including 0.

Note that you may have multiple coins of the same value.

Example 1:

Input: coins = [1,3]
Output: 2
Explanation: You can make the following values:
- 0: take []
- 1: take [1]
You can make 2 consecutive integer values starting from 0.

Example 2:

Input: coins = [1,1,1,4]
Output: 8
Explanation: You can make the following values:
- 0: take []
- 1: take [1]
- 2: take [1,1]
- 3: take [1,1,1]
- 4: take [4]
- 5: take [4,1]
- 6: take [4,1,1]
- 7: take [4,1,1,1]
You can make 8 consecutive integer values starting from 0.

Example 3:

Input: nums = [1,4,10,3,1]
Output: 20

Constraints:

coins.length == n
1 <= n <= 4 * 10^4
1 <= coins[i] <= 4 * 10^4

解题思路

对coins排序后，就变成了一个简单的dp。核心点是想明白，如果dp[i]能够得到一个最大的连续的数字x，因为是连续的，所以必然能拼出来x-1, x-2, x-3, ..., 0，所以如果有一个新数字i，只要当i不是大于x+1（大于x+1时，这个x+1的空缺没人填了），那么就可以再拼出来x+i的连续数字

转移方程很简单：$dp[i]=dp[i-1]+i,i\le dp[i-1]+1$

时间复杂度：$o(nlogn)$（排序的时间复杂度，dp本身是$o(n)$），空间复杂度$o(1)$（因为dp数组只有一维所以压缩一下用一个变量保存即可）

代码

class Solution:
    def getMaximumConsecutive(self, coins: List[int]) -> int:
        coins.sort()
        max_num = 0
        for index in range(len(coins)):
            if coins[index] <= max_num + 1:
                max_num += coins[index]
        return max_num + 1