leetcode

0 class Solution {

1 public:

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

3 static int count[102];

4 const int n = size(nums);

5

6 memset(count, 0x00, sizeof(count));

7 for (const int m : nums)

8 count[min(n, m)]++;

9 for (int i = size(nums); i >= 0; i--) {

10 count[i] += count[i + 1];

11 if (count[i] == i) return i;

12 }

13

14 return -1;

15 }

16 };