Maximum Number of Consecutive Values You Can Make LeetCode solution in C++

1
class Solution {
2
public:
3
int getMaximumConsecutive(vector<int> &coins) {
4
sort(coins.begin(), coins.end());
5
int n = coins.size();
6
int ans = 1;
7
for (int i = 0; i < n; i++) {
8
if (coins[i] > ans) return ans;
9
ans += coins[i];
10
}
11
return ans;
12
}
13
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0