leetcode

0 class Solution {

1 public:

2 int maxCount(const vector<int> &banned, int n, int maxSum) const {

3 unordered_set<int> us(begin(banned), end(banned));

4

5 int res = 0, sum = 0;

6 for (int i = 1; i <= n; i++) {

7 if (us.count(i)) continue;

8 sum += i;

9 if (sum > maxSum) return res;

10 res++;

11 }

12

13 return res;

14 }

15 };