StarWalker

Where my heart will take me

0%

Leetcode179-Largest Number

Posted on Edited on In Views: Valine:
Solution Report of LeetCode Acceptted

Description

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

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

Example

Example 1:

1
2
Input: nums = [10,2]
Output: "210"

Example 2:
1
2
Input: nums = [3,30,34,5,9]
Output: "9534330"

Example 3:
1
2
Input: nums = [1]
Output: "1"

Example 4:
1
2
Input: nums = [10]
Output: "10"

Constraints:

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 10^9

Solution

  • Time Complexity:
  • Space Complexity: 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
    public String largestNumber(int[] nums) {
        if (nums == null || nums.length == 0) return "";
        String[] sarr = new String[nums.length];
        for (int i = 0; i < nums.length; i++){
            sarr[i] = String.valueOf(nums[i]);
        }
        Arrays.sort(sarr, new Comparator<String>(){
            @Override
            public int compare(String a, String b){
                return (b + a).compareTo(a + b);
            }
        });
        StringBuilder res = new StringBuilder();
        for (String str: sarr)
            res.append(str);
        if (res.charAt(0) == '0')
            return "0";
        return res.toString();
    }
}