LeetCode 풀기 - 1356. Sort Integers by The Number of 1 Bits

1356. Sort Integers by The Number of 1 Bits

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

Sort Integers by The Number of 1 Bits - LeetCode

문제)

솔루션1)

class Solution:
    def sortByBits(self, arr: List[int]) -> List[int]:
        d = {}
        
        # 0 <= arr[i] <= 10000
        for i in range(15):
            d[i] = []

        for n in arr:
            count = bin(n).count('1')
            d[count].append(n)
         
        res = []
        for nums in d.values():
            if nums:
                nums.sort()
                res += nums
                
        return res

솔루션2)

class Solution:
    def sortByBits(self, arr: List[int]) -> List[int]:
        return sorted(arr, key=lambda x: [bin(x).count('1'), x])