【LeetCode】 1356. Sort Integers by The Number of 1 Bits 根据数字二进制下 1 的数目排序(Easy)(JAVA)

【LeetCode】 1356. Sort Integers by The Number of 1 Bits 根据数字二进制下 1 的数目排序(Easy)(JAVA)

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

题目描述:

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]

Constraints:

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

题目大意

给你一个整数数组 arr 。请你将数组中的元素按照其二进制表示中数字 1 的数目升序排序。

如果存在多个数字二进制中 1 的数目相同,则必须将它们按照数值大小升序排列。

请你返回排序后的数组。

解题方法

  1. 算出所有数值 1 的个数,存在二维数组里面 cur[i][0] = arr[i], cur[i][1] = the num of 1 Bits
  2. 对 cur 二维数组进行排序,优先对二进制中 1 的数目排序,后对当前元素排序
class Solution {
    public int[] sortByBits(int[] arr) {
        int[][] cur = new int[arr.length][2];
        for (int i = 0; i < arr.length; i++) {
            cur[i][0] = arr[i];
            cur[i][1] = sH(arr[i]);
        }
        Arrays.sort(cur, (a, b) -> (a[1] == b[1] ? a[0] - b[0] : a[1] - b[1]));
        for (int i = 0; i < arr.length; i++) {
            arr[i] = cur[i][0];
        }
        return arr;
    }
    
    public int sH(int i) {
        int res = 0;
        while (i > 0) {
            if (i % 2 == 1) res++;
            i /= 2;
        }
        return res;
    }
}

执行耗时:11 ms,击败了37.33% 的Java用户
内存消耗:39.2 MB,击败了48.78% 的Java用户

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值