2023.10.31 Today's Challenge

https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/

Sort Integers by The Number of 1 Bits - LeetCode

오랫만에 직접 품.

좀 더 간단한 방법이 있을지도..

 

class Solution:
    def sortByBits(self, arr: List[int]) -> List[int]:
        d = {}
        res = []
        for v in arr:
            k = bin(v).count('1')
            if not d.get(k):
                d[k] = [v]
                continue
            d[k].append(v)
        d = sorted(d.items())
        for dd in d:
            res.extend(sorted(dd[1]))
        return res