String - 179. Largest Number

ppxai

发布于 2020-09-23 17:13:37

3730

发布于 2020-09-23 17:13:37

文章被收录于专栏：皮皮星球皮皮星球

179. Largest Number

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

Example 1:

Input: [10,2] Output: "210"

Example 2:

Input: [3,30,34,5,9] Output: "9534330"

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

思路：

贪心的思想，比较相邻两个字符串拼接结果，比较大小。

代码：

java：

class Solution {

    public String largestNumber(int[] nums) {

        if (nums == null || nums.length == 0) return "";
        
        int len = nums.length;
        
        String [] strs = new String[len];
        for (int i = 0; i < len; i++) {
            strs[i] = String.valueOf(nums[i]);
        }
        
        Comparator<String> comp = new Comparator<String>(){
            @Override
            public int compare(String str1, String str2) {
                String s1 = str1 +str2;
                String s2 = str2 +str1;
                return s2.compareTo(s1);
            }
        };
        
        Arrays.sort(strs, comp);
        if(strs[0].charAt(0) == '0') return "0";
        
        StringBuilder sb = new StringBuilder();
        for (String s : strs) {
            sb.append(s);
        }
        
        return sb.toString();
    }
}

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2019年07月01日，如有侵权请联系 cloudcommunity@tencent.com 删除

java