题目链接
题目分析
给出若干有前导零的数字串,将它们拼接,使生成的数最小
解题思路
- 贪心策略:直接按字典排序会有问题,稍作调整
- 正确解法:
字符串a,b排序: 若 a + b < b + a,则a排在b前
AC程序(C++)
/**************************
*@Author: 3stone
*@ACM: PAT. A1038 Recover the Smartest Number
*@Time: 17/2/18
*@IDE: VS 2017
***************************/
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#define maxSize 10010
using namespace std;
string p[maxSize];
bool cmp(string a, string b) { //字符串拼接 比较
return a + b < b + a;
}
int main() {
int n;
string min = "0";
while(scanf("%d", &n) != EOF) {
for (int i = 0; i < n; i++)
cin >> p[i];
//排序
sort(p, p + n, cmp);
//拼接
for (int i = 0; i < n; i++) {
min += p[i];
}
//删除前导零
while(true) {
if (min[0] == '0' && min.size() > 1)
min.erase(0, 1);
else
break;
}
cout << min << endl;
}
return 0;
}