public class P179LargestNumber{
public static void main(String[] args) {
Solution solution = new P179LargestNumber().new Solution();
// TO TEST
}
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public String largestNumber(int[] nums) {
String[] str = new String[nums.length];//安全创建数组的方式
int i=0;
for(int num : nums){
str[i++]= String.valueOf(num); //int转string
}
//排序str数组并且自己重写排序规则,来定义系统库里sort函数的排序规则(sort底层是归并排序,默认升序)
Arrays.sort(str, new Comparator<String>() {
@Override
public int compare(String x, String y) {
String xy = x + y;
String yx = y + x;
return yx.compareTo(xy);
}
});
if("0".equals(str[0])){
return "0";
}
StringBuilder sb = new StringBuilder(); //记住java中的这个object
for(String s : str){
sb.append(s); //往末尾添加字符
}
return sb.toString(); //stringBuilder要转成字符串
}
}
//leetcode submit region end(Prohibit modification and deletion)
}