179. Largest Number

最新推荐文章于 2024-01-15 19:35:39 发布

原创最新推荐文章于 2024-01-15 19:35:39 发布 · 100 阅读

0 ·

CC 4.0 BY-SA版权

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文探讨了一种算法，该算法接收一个非负整数数组，并通过重新排列这些整数形成可能的最大数值。示例展示了如何将[10,2]转化为210，以及[3,30,34,5,9]转化为9534330的过程。算法使用自定义排序策略，将字符串拼接后的大小作为比较依据。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

179. Largest Number

Medium

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.

class Solution {
    public String largestNumber(int[] nums) {
        if (null == nums) {
            return "0";
        }
        
        String[] ss = new String[nums.length];
        int n = nums.length;
        for (int i = 0; i < n; i++) {
            ss[i] = String.valueOf(nums[i]);
        }
        
        Arrays.sort(ss, (s1, s2) -> {
            String s1s2 = s1 + s2;
            String s2s1 = s2 + s1;
            
            return s2s1.compareTo(s1s2);
        });

        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            sb.append(ss[i]);
        }
        String result = new String(sb);
        return '0' == result.charAt(0) ? "0" : result;
    }
}