Leetcode 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.


Difficulty: Medium


public class Solution {
    public String largestNumber(int[] nums) {
        String[] list = new String[nums.length];
        for(int i = 0; i < nums.length; i++){
            list[i] = Integer.toString(nums[i]);
        }
        Arrays.sort(list, new Comparator<String>(){
            public int compare(String s1, String s2){
                String leftRight = s1+s2;
                String rightLeft = s2+s1;
                return -leftRight.compareTo(rightLeft);
                }
        });
        String ans = "";
        for(String str : list){
            ans = ans + str;
        }
        if(ans.length() == 0 || ans.charAt(0) == '0')
            return "0";
        return ans;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值