leetcode 1356. Sort Integers by The Number of 1 Bits（python）

leetcode 1356. Sort Integers by The Number of 1 Bits（python）

描述

Given an integer array arr. You have to sort the integers in the array in ascending order by the number of 1’s in their binary representation and in case of two or more integers have the same number of 1’s you have to sort them in ascending order.

Return the sorted array.

Example 1:

Input: arr = [0,1,2,3,4,5,6,7,8]
Output: [0,1,2,4,8,3,5,6,7]
Explantion: [0] is the only integer with 0 bits.
[1,2,4,8] all have 1 bit.
[3,5,6] have 2 bits.
[7] has 3 bits.
The sorted array by bits is [0,1,2,4,8,3,5,6,7]	

Example 2:

Input: arr = [1024,512,256,128,64,32,16,8,4,2,1]
Output: [1,2,4,8,16,32,64,128,256,512,1024]
Explantion: All integers have 1 bit in the binary representation, you should just sort them in ascending order.

Example 3:

Input: arr = [10000,10000]
Output: [10000,10000]

Example 4:

Input: arr = [2,3,5,7,11,13,17,19]
Output: [2,3,5,17,7,11,13,19]

Example 5:

Input: arr = [10,100,1000,10000]
Output: [10,100,10000,1000]

Note:

1 <= arr.length <= 500
0 <= arr[i] <= 10^4

解析

根据题意，按照每个数字的二进制中包含 1 的个数进行排序，当包含 1 的个数相同的元素按照升序排列，最后按照包含 1 的个数从小到大进行排列即可。这里直接用内置的函数 bin 来获取 1 的个数，然后通过 sorted 对元祖 (包含 1 的个数,数字本身)进行排序即可满足题意。

解答

class Solution(object):
    def sortByBits(self, arr):
        """
        :type arr: List[int]
        :rtype: List[int]
        """
        return sorted(arr, key=lambda x: (bin(x).count("1"),x))

运行结果

Runtime: 52 ms, faster than 83.13% of Python online submissions for Sort Integers by The Number of 1 Bits.
Memory Usage: 13.9 MB, less than 5.62% of Python online submissions for Sort Integers by The Number of 1 Bits.

原题链接：https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/