void MyOutPut(char *str)
{
char *temp = str;
bool lastNum = false;
int aggr[100] = {0};
int len = 0;
int nIndex = 0;
//获取所有的数字
while(*temp)
{
if(*temp >= '0' && *temp <= '9')
{
if(!lastNum)
{
aggr[nIndex] = *temp - 48;
nIndex++;
}
else
{
aggr[nIndex - 1] = aggr[nIndex - 1] * 10 + *temp - 48;
}
lastNum = true;
}
else
{
lastNum = false;
}
*temp++;
}
//排序
for(int i = 0 ; i < nIndex; ++i)
{
for(int j = 0;j < nIndex - i - 1; ++j)
{
if(aggr[j] > aggr[j + 1])
{
int nMax = aggr[j];
aggr[j] = aggr[j + 1];
aggr[j + 1] = nMax;
}
}
}
//输出
for(int i = 0; i < nIndex - 1; i++)
{
printf("%d-", aggr[i]);
}
printf("%d", aggr[nIndex - 1]);
printf("\n");
}