Largest Number


https://leetcode.com/problems/largest-number/

Given a list of non negative integers, arrange them such that they form the largest number.

For example, given [3, 30, 34, 5, 9], the largest formed number is9534330.

Note: The result may be very large, so you need to return a string instead of an integer.

public String largestNumber(int[] num)

这一题其实本质就是一种特殊的排序。

这个排序遵循着这样一个原理:如果两个数字是a和b,如果ab排列大于ba,那么我们就应当把a排在b前面,同样的,如果cab大于abc,c就应该排在a和b的前面。这事实上包含着贪心的思想在里面,我们总是尝试着把a和b在ab和ba排列组合中较大的放在前者。譬如说,在给定a,b,c三个数字里,ab大于ba的话,a应该在b的前面,ca大于ac的话。c就应该在a和b的前面,这里隐藏了一个事情,就是我们认为cb大于bc,同时cab大于abc和bac。

如何证明这件事情呢。有点麻烦,暂时就不证明了

于是乎一个简单的做法就出来了。实现一个比较器,比较的策略就按照刚才说的那样, ab 和 ba 比, 谁大前面那个就排在前面,也就是ab > ba就是a在b前面。然后用这个比较器排序,再将排序好的数组连起来,然后,就可以了。。。


给出代码如下:

    public String largestNumber(int[] num) {
        Integer[] numnum = new Integer[num.length];
        for(int i = 0; i < num.length; i++)
            numnum[i] = num[i];
        Arrays.sort(numnum, new newComparator());
        StringBuilder res = new StringBuilder();
        for(Integer i : numnum)
            res.append(i);
        return res.charAt(0) == '0' ? "0" : res.toString();//test case有全部0的。所以防止连接了一坨0
    }
    
    class newComparator implements Comparator<Integer>{
        @Override
        public int compare(Integer a, Integer b){
            return (new String(b + "" + a)).compareTo(a + "" + b);
        }
    }

这段代码有问题,修改一下,MOV r0, #0x00002000 ; Initialize pointer to first number MOV r1, #9 ; Initialize counter with number of elements LDR r7, [r0] ; Load first number as largest LDR r8, [r0] ; Load first number as smallest Loop: ADD r0, r0, #4 ; Move pointer to next number LDR r2, [r0] ; Load the number in r2 CMP r7, r2 ; Compare largest with current number MOVLT r7, r2 ; If current number is smaller, update largest CMP r8, r2 ; Compare smallest with current number MOVGT r8, r2 ; If current number is larger, update smallest SUBS r1, r1, #1 ; Decrement counter BNE Loop ; Loop until all numbers are compared ; Display largest number on console MOV r0, #1 ; File descriptor for stdout LDR r1, =largest ; Address of string to be displayed MOV r2, #10 ; Length of string MOV r7, #4 ; Syscall number for write SWI 0 ; Call operating system ; Display largest number on LCD screen LDR r0, =0x40020C14 ; Address of LCD data register MOV r1, r7 ; Load largest number from r7 STR r1, [r0] ; Store the number in the LCD data register ; Display smallest number on console MOV r0, #1 ; File descriptor for stdout LDR r1, =smallest ; Address of string to be displayed MOV r2, #12 ; Length of string MOV r7, #4 ; Syscall number for write SWI 0 ; Call operating system ; Display smallest number on LCD screen LDR r0, =0x40020C14 ; Address of LCD data register MOV r1, r8 ; Load smallest number from r8 STR r1, [r0] ; Store the number in the LCD data register largest: .asciz "Largest number: %d\n" smallest: .asciz "Smallest number: %d\n"
05-27
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值