hdu 1106 去5排序

#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <sstream>            //  istringstream头文件
using namespace std;
int ans[1100];

int deal(string a)                   //将这一段字符串转化为对应的数字
{
    int i = 0;
    while (a[i] == ‘0‘)              //去前导0
    {
        i++;
    }
    if (i == a.length())return 0;      //如果全是0的话，输出0
    else
    {
        int sum = 0; int cur = 1;
        for (int j = a.length() - 1; j >= i; j--)
        {
            sum += (a[j]-‘0‘) * cur;
            cur *= 10;
        }
        return sum;
    }
}

int main()
{
    string str;
    while (cin >> str)
    {
        memset(ans, 0, sizeof(ans));
        int num = 0;
        for (int i = 0; i < str.length(); i++)
        {
            if (str[i] == ‘5‘)str[i] = ‘ ‘;
        }
        istringstream tmp(str);
        string aa; int res = 0;
        while (tmp >> aa)                //将带空格的字符串流转化为一个个独立的string
        {
            int num = deal(aa);
            ans[res++] = num;
        }
        sort(ans, ans + res);
        for (int i = 0; i < res - 1; i++)printf("%d ", ans[i]);
        printf("%d\n", ans[res - 1]);
    }
    return 0;
}