MyLeetcode/cpp_solutions/2456.cpp at main · Kaminyou/MyLeetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
class Solution {
public:
    vector<vector<string>> mostPopularCreator(vector<string>& creators, vector<string>& ids, vector<int>& views) {
        int n = creators.size();

        // count views
        int maxView = 0;
        unordered_map<string, int> mp;
        unordered_map<string, pair<string, int>> creator2bestView;
        for (int i = 0; i < n; ++i) {
            mp[creators[i]] += views[i];
            maxView = max(maxView, mp[creators[i]]);

            if (creator2bestView.find(creators[i]) == creator2bestView.end()) {
                creator2bestView[creators[i]] = {ids[i], views[i]};
            }
            else {
                if (views[i] > creator2bestView[creators[i]].second) {
                    creator2bestView[creators[i]] = {ids[i], views[i]};
                }
                else if (views[i] == creator2bestView[creators[i]].second) {
                    if (ids[i] < creator2bestView[creators[i]].first) {
                        creator2bestView[creators[i]] = {ids[i], views[i]};
                    }
                }
            }
        }

        vector<vector<string>> res;
        // find their id with the most view
        for (auto& [creator, cnt] : mp) {
            if (cnt == maxView) {
                res.push_back({creator, creator2bestView[creator].first});
            }
        }
        return res;
    }
};