leetcode

0 class Solution {

1 public:

2 vector<vector<int>> groupThePeople(const vector<int> &groupSizes) {

3 unordered_map<int, vector<int>> um;

4 vector<vector<int>> res;

5

6 for (int i = 0; i < groupSizes.size(); i++) {

7 if (groupSizes[i] == 1)

8 res.push_back({i});

9 else {

10 int size = groupSizes[i];

11 um[size].push_back(i);

12 if (um[size].size() == size) {

13 res.push_back({});

14 swap(res.back(), um[size]);

15 }

16 }

17 }

18

19 return res;

20 }

21 };