LeetCode中等题1387.将整数按权重排序

 

 

 public int getKth(int lo, int hi, int k) {
        int[][] arr=new int[hi-lo+1][2];
        for(int i=lo;i<=hi;i++){
            arr[i-lo][0]=quan(i);
            arr[i-lo][1]=i;
        }
        Arrays.sort(arr,(a,b)->{
            if(a[0]!=b[0])return a[0]-b[0];
            return a[1]-b[1];
        });
        return arr[k-1][1];
    }

    public int quan(int x){
        int res=0;
        while(x!=1){
            if(x%2==0){
                x/=2;
            }else{
                x=x*3+1;
            }
            res++;
        }
        return res;
    }