题目:
题解:
1. 题解一:
2. 题解二:
* 解题思路:
* 先将整型数组转换成String数组,然后将String数组排序,最后将排好序的字符串数组拼接出来。关键就是制定排序规则。
* 排序规则如下:
* 若ab > ba 则 a > b,(a > b 的意思是 b 排在 a 前面)
* 若ab < ba 则 a < b,(a < b 的意思是 a 排在 b 前面)
* 若ab = ba 则 a = b;(a = b 的意思是 a 和 b 谁在前面无所谓)
* 解释说明:
* 比如 "3" < "31"但是 "331" > "313"(因此选择 31 排在 3 前面),所以要将二者拼接起来进行比较
代码:
1. 代码一:
/**
* 面试题45
*/
import java.util.*;
public class 面试题45 {
public static String minNumber(int[] nums) {
String str[] = new String[nums.length];
for(int i = 0; i < str.length; i++)
{
str[i] = String.valueOf(nums[i]);
}
Arrays.sort(str, (s1, s2) -> (s1 + s2).compareTo(s2 + s1));
StringBuilder res = new StringBuilder();
for(int i = 0; i < str.length; i++)
{
res.append(str[i]);
}
return res.toString();
}
public static void main(String[] args) {
int nums[] = { 3, 30, 34, 5, 9 };
String res = minNumber(nums);
System.out.println(res);
}
}
2. 代码二:
import java.util.Arrays;
import java.util.Comparator;
/**
* @Author: zyx
* @Date: 2019/4/18 23:37
* @Description:
**/
public class Solution {
public String PrintMinNumber(int[] numbers) {
if (numbers == null || numbers.length == 0) {
return "";
}
int len = numbers.length;
String str[] = new String[len];
StringBuilder sb = new StringBuilder();
for (int i = 0; i < len; i++) {
str[i] = String.valueOf(numbers[i]);
}
Arrays.sort(str, new Comparator<String>() {
@Override
public int compare(String s1, String s2) {
String c1 = s1 + s2;
String c2 = s2 + s1;
return c1.compareTo(c2);
}
});
for (int i = 0; i < len; i++) {
sb.append(str[i]);
}
return sb.toString();
}
}