g0101_0200.s0179_largest_number.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0101_0200.s0179_largest_number;

// #Medium #Top_Interview_Questions #String #Sorting #Greedy
// #2022_06_26_Time_10_ms_(54.50%)_Space_43.6_MB_(59.08%)

import java.util.Arrays;

/**
 * 179 - Largest Number\.
 *
 * Medium
 *
 * 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 1:**
 *
 * **Input:** nums = [10,2]
 *
 * **Output:** "210" 
 *
 * **Example 2:**
 *
 * **Input:** nums = [3,30,34,5,9]
 *
 * **Output:** "9534330" 
 *
 * **Example 3:**
 *
 * **Input:** nums = [1]
 *
 * **Output:** "1" 
 *
 * **Example 4:**
 *
 * **Input:** nums = [10]
 *
 * **Output:** "10" 
 *
 * **Constraints:**
 *
 * *   `1 <= nums.length <= 100`
 * *   0 <= nums[i] <= 10⁹
**/
public class Solution {
    public String largestNumber(int[] nums) {
        int n = nums.length;
        String[] s = new String[n];
        for (int i = 0; i < n; i++) {
            s[i] = String.valueOf(nums[i]);
        }
        Arrays.sort(s, (a, b) -> (b + a).compareTo(a + b));
        StringBuilder sb = new StringBuilder();
        for (String str : s) {
            sb.append(str);
        }
        String result = sb.toString();
        return result.startsWith("0") ? "0" : result;
    }
}