首页 > 其他 > 详细

179. Largest Number

时间:2016-10-08 16:30:12      阅读:154      评论:0      收藏:0      [点我收藏+]

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.

思路:将array排序,按照相互之间加和大者在前的排在前面为标准.

public class Solution {
    public String largestNumber(int[] nums) {
        
        String[] res=new String[nums.length];
        
        for(int i=0;i<nums.length;i++)
        {
            res[i]=String.valueOf(nums[i]);
        }   
            Arrays.sort(res,(str1,str2)->(str2+str1).compareTo(str1+str2));
        if(res[0].equals("0"))
        {
            return "0";
        }

        StringBuilder sb=new StringBuilder();
        
        for(String check:res)
        {
            sb.append(check);
        }
        return sb.toString();
    }
}

 

 
 

179. Largest Number

原文:http://www.cnblogs.com/Machelsky/p/5938885.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!