leetcode

0 class Solution {

1 public:

2 vector<int> relocateMarbles(const vector<int> &nums, const vector<int> &moveFrom,

3 const vector<int> &moveTo) const {

4 unordered_map<int, int> um;

5 vector<int> res;

6

7 for (const int num : nums)

8 um[num]++;

9 for (int i = 0; i < size(moveFrom); i++) {

10 if (moveTo[i] == moveFrom[i]) continue;

11 um[moveTo[i]] += um[moveFrom[i]];

12 um[moveFrom[i]] = 0;

13 }

14

15 for (const auto [k, v] : um)

16 if (v) res.push_back(k);

17 sort(begin(res), end(res));

18

19 return res;

20 }

21 };