SOLUTION INFO
C++ · main.cpp
class Solution {
public:
vector<int> queryResults(int limit, vector<vector<int>>& queries) {
vector<int> answer;
unordered_map<int, int> mp, color;
for(int i = 0; i < (int)queries.size(); ++i) {
int u = queries[i][0], v = queries[i][1];
if(color[u] > 0 && --mp[color[u]] == 0) mp.erase(color[u]);
color[u] = v;
++ mp[v];
answer.push_back(mp.size());
}
return answer;
}
};
SOLUTION DESCRIPTION
풀이 설명
등록된 풀이 설명이 없습니다.