leetcode

0 class Solution {

1 public:

2 int countWays(vector<int> &nums) const {

3 sort(begin(nums), end(nums));

4

5 const int n = size(nums);

6 int res = 0, sel = 0;

7 for (int i = 0; i < n - 1; i++) {

8 if (i + 1 <= nums[i]) continue;

9 if (i + 1 < nums[i + 1]) res++;

10 }

11

12 if (n > nums[n - 1]) res++;

13 return res + (nums[0] != 0);

14 }

15 };