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 is 9534330.

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

 

public class Solution {
    public String largestNumber(int[] nums) {
        int len = nums.length;
        if (len < 1) {
        	return "";
        }
        String[] strs = new String[len];
        for (int i = 0; i < len; i++) {
        	strs[i] = String.valueOf(nums[i]);
		}
        Arrays.sort(strs, new Comparator<String>() {

			@Override
			public int compare(String o1, String o2) {
				// TODO Auto-generated method stub
				return (o1 + o2).compareTo(o2 + o1);
			}
		});
        StringBuffer res = new StringBuffer();
        for (int i = len-1; i >= 0; i--) {
        	res.append(strs[i]);
		}
        int i = 0;
        while (i < len && res.charAt(i) == '0') {
        	i++;
        }
        if (i == len) {
        	return "0";
        }
        return res.substring(i).toString();
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值