1.使用库函数排序
class Solution {
public String crackPassword(int[] password) {
List<String> strList = new ArrayList<>();
for (int k : password) {
strList.add(String.valueOf(k));
}
Collections.sort(strList, (s1, s2) -> (s1 + s2).compareTo(s2 + s1));
StringBuilder res = new StringBuilder();
for (String s : strList) {
res.append(s);
}
return res.toString();
}
}
2.快排
关于理解快排的好文:https://zhuanlan.zhihu.com/p/350934702
class Solution {
public String crackPassword(int[] password) {
String[] passStrArray = new String[password.length];
for (int i = 0; i < password.length; ++i) {
passStrArray[i] = String.valueOf(password[i]);
}
quickSort(passStrArray, 0, passStrArray.length - 1);
StringBuilder res = new StringBuilder();
for (String s : passStrArray) {
res.append(s);
}
return res.toString();
}
public void quickSort(String[] array, int start, int end) {
if (start >= end) {
return;
}
int l = start, r = end;
while (l < r) {
while ((array[r] + array[start]).compareTo(array[start] + array[r]) >= 0 && l < r) {
--r;
}
while ((array[l] + array[start]).compareTo(array[start] + array[l]) <= 0 && l < r) {
++l;
}
if (l < r) {
swap(array, l, r);
} else {
break;
}
}
swap(array, start, r);
quickSort(array, start, r - 1);
quickSort(array, r + 1, end);
}
public void swap(String[] array, int i, int j) {
String tmp = array[i];
array[i] = array[j];
array[j] = tmp;
}
}
Solution1:
20180904复习。重点记忆比较技巧!!!
代码参考网址:https://www.nowcoder.com/profile/4163181/codeBookDetail?submissionId=15577844
别人的思路好牛逼啊!啊!啊!学习一个
numbers的前提是正整数数组~~~
class Solution {
public:
string PrintMinNumber(vector<int> numbers) {
int len = numbers.size();
if(len == 0) return "";
sort(numbers.begin(), numbers.end(), cmp);
string res;
for(int i = 0; i < len; i++){
res += to_string(numbers[i]);
}
return res;
}
static bool cmp(int a, int b) {
string A = to_string(a) + to_string(b);
string B = to_string(b) + to_string(a);
return A < B;
}
};