leetcode--Largest Number

最新推荐文章于 2022-07-28 15:00:32 发布

原创最新推荐文章于 2022-07-28 15:00:32 发布 · 660 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

177 篇文章

订阅专栏

本文介绍了一个算法，用于将一组非负整数排列成最大的数值字符串。通过比较整数相加后的字符串来决定整数的顺序。

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

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.

public class Solution {
    public String largestNumber(int[] nums) {
		ArrayList<Integer> arr = new ArrayList<>();
		for(int i=0;i<nums.length;i++){
			arr.add(nums[i]);
		}
		Collections.sort(arr, new Comparator<Integer>() {
			@Override
			public int compare(Integer o1, Integer o2) {								
				String str1 = o1+""+o2;
				String str2 = o2+""+o1;
				return str2.compareTo(str1);
			}
		});
		if(arr.get(0)==0) return "0";
		StringBuilder sb = new StringBuilder();
		for(Integer i:arr){
			sb.append(i);
		}
		return sb.toString();		
    }
}