1038. Recover the Smallest Number (30)

Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different orders of combinations of these segments, and the smallest number is 0229-321-3214-32-87.

Input Specification:

Each input file contains one test case. Each case gives a positive integer N (<=10000) followed by N number segments. Each segment contains a non-negative integer of no more than 8 digits. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the smallest number in one line. Do not output leading zeros.

Sample Input:

5 32 321 3214 0229 87

Sample Output:

22932132143287

思路是排序时比较2个字符串在其长度范围内大小，如果一个数比完了的话，即一个数是另一个数的子串，例如"321"和"3214"

那么就重新比较较长的字符串的剩余字符串和原来的较短字符串，即比较"4"和"321"，这里递归用cmp函数实现了；至于这样

比较的缘由，分析321为什么在3214前面可以看出如果321在前那么第四位是3而3214在前第三位为4，所以比较的是除了相同

位之后的位数与较短的数字第一位比较；

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

bool cmp(const string &a, const string &b)
{
    int i, minsize;
    minsize = min(a.size(), b.size());
    for(i=0; i<minsize; i++)
    {
        if(a[i] != b[i])
            return a[i] < b[i];
    }
    if(i == minsize)
    {
        string x;
        if(a.size() > b.size())
        {
            x = a.substr(b.size());//截取剩余部分
            return cmp(x, b);
        }
        else if(a.size() < b.size()){
            x = b.substr(a.size());
            return cmp(a, x);
        }
    }
    return false;
}

int main()
{
    int n, m;
    vector<string> v1;
    string temp;
    string res;
    cin >> n;
    for(int i=0; i<n; i++)
    {
        cin >> temp;
        v1.push_back(temp);
    }
        sort(v1.begin(), v1.end(), cmp);
    for(int i=0; i<n; i++)
    {
        res += v1[i];
    }
    for(m=0; res[m]=='0'; m++);
    if(m == res.size())
        res = "0";
    else
        res = res.substr(m);
    cout << res << endl;
    return 0;
}