选择排序:
class Solution {
public void swap(String[] str, int i, int j) {
String temp = str[i];
str[i] = str[j];
str[j] = temp;
}
public String minNumber(int[] nums) {
int len = nums.length;
String[] str = new String[len];
for (int i = 0; i < len; i++) {
str[i] = String.valueOf(nums[i]);
}
for (int i = 0; i < str.length - 1; i++) {
for (int j = i + 1; j < str.length; j++) {
if ((str[i] + str[j]).compareTo((str[j] + str[i])) > 0) {
swap(str, i, j);
}
}
}
StringBuffer sb = new StringBuffer();
for (String s : str) {
sb.append(s);
}
return sb.toString();
}
}
冒泡排序:
class Solution {
public void swap(String[] str, int i, int j) {
String temp = str[i];
str[i] = str[j];
str[j] = temp;
}
public String minNumber(int[] nums) {
int len = nums.length;
String[] str = new String[len];
for (int i = 0; i < len; i++) {
str[i] = String.valueOf(nums[i]);
}
boolean flag = true;
for (int i = 0; i < str.length - 1; i++) {
for (int j = 0; j < str.length - i - 1; j++) {
if ((str[j] + str[j + 1]).compareTo((str[j + 1] + str[j])) > 0) {
swap(str, j, j + 1);
flag =false;
}
}
if (flag == true) {
break;
}
}
StringBuffer sb = new StringBuffer();
for (String s : str) {
sb.append(s);
}
return sb.toString();
}
}
内置函数 + Comparator:
class Solution {
public void swap(String[] str, int i, int j) {
String temp = str[i];
str[i] = str[j];
str[j] = temp;
}
public String minNumber(int[] nums) {
int len = nums.length;
String[] str = new String[len];
for (int i = 0; i < len; i++) {
str[i] = String.valueOf(nums[i]);
}
Arrays.sort(str, new Comparator<String>(){
public int compare(String o1, String o2) {
return (o1 + o2).compareTo((o2 + o1));
}
});
StringBuffer sb = new StringBuffer();
for (String s : str) {
sb.append(s);
}
return sb.toString();
}
}