leetcode 1356. Sort Integers by The Number of 1 Bits 根据数字二进制下 1 的数目排序-耗时100

Problem: 1356. Sort Integers by The Number of 1 Bits 根据数字二进制下 1 的数目排序耗时100%首先拿到每个数字的二进制表达的1的个数然后按照题意排序排好序以后放入结果数组ret内Codeclass Solution { public: vectorint sortByBits(vectorint arr) { vectorpairint, int tmp; int n arr.size(); for(int i 0; i n; i) { tmp.push_back( { __builtin_popcount(arr[i]), i } ); } functionbool(pairint, int, pairint, int) func [](pairint, int a, pairint, int c) - bool { if(a.firstc.first) return arr[a.second] arr[c.second]; else return a.first c.first; }; sort(tmp.begin(), tmp.end(), func); vectorint ret; for(int i 0; i n; i) { ret.push_back(arr[tmp[i].second]); } return ret; } };