leetcode 1636. 按照频率将数组升序排序-耗时100-Sort Array by Increasing Frequency

Problem: 1636. 按照频率将数组升序排序- Sort Array by Increasing Frequency耗时100%哈希表统计频次然后频次和数字放入数组按照题意的规则排序最后得到最终的数组Codeclass Solution { public: int ump[201]; vectorint frequencySort(vectorint nums) { memset(ump, 0, sizeof(ump)); for(int i : nums) ump[i100]; vectorpairint, int tr; int cnt, a; for(int i 0; i 201; i) { a ump[i]; if(a 0) tr.push_back({a, i-100}); } functionbool(pairint, int, pairint, int) func [](pairint, int a, pairint, int c) - bool { if(a.first c.first) return a.second c.second; else return a.first c.first; }; sort(tr.begin(), tr.end(), func); vectorint ret; for(pairint, int p : tr) { cnt p.first; a p.second; for(int i 0; i cnt; i) ret.push_back(a); } return ret; } };