输入一个非负整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。
示例 1:
输入: [10,2]
输出: "102"
示例 2:
public class minNumber {
public String minNumber(int[] nums) {
String[] str =new String[nums.length];
for(int i=0;i<nums.length;i++){
str[i]=String.valueOf(nums[i]); //将任意数据类型转为字符串
}
Arrays.sort(str,(x,y)->(x+y).compareTo(y+x)); //排序 匿名函数
StringBuilder reStringBuilder =new StringBuilder(); //字符串构造
for (String string : str) {
reStringBuilder.append(string);
}
return reStringBuilder.toString();
}
import functools
class Solution:
def minNumber(self, nums) -> str:
def sort_rule(x, y):
a, b = x + y, y + x
if a > b:
return 1
elif a < b:
return -1
else:
return 0
strs = [str(num) for num in nums]
strs.sort(key=functools.cmp_to_key(sort_rule))
return ''.join(strs)