字符串转整型并排序

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

int cmp(const void *a, const void *b)//返回值是整型的

{

return *(int *)a- *(int *)b; //注意是 (int *) a

}

int main()

{

char str[1005];

int a[1005];

while(scanf("%s",str)!=EOF)

{

int l = strlen(str);

int count = 0;

int i;

int num = 0;

int ant;

if(str[l-1]!='5')

str[l] = '5'; //最后执行a[count++] = num; 循环结束前赋值

for(i=0; i<=l; i++)

{

if(str[i]!='5')

{

num = num*10+str[i]-'0';// eg:
str[i]='3','3'-'0'=3

ant = 0;

}

else if(ant==1) continue;//判断str[i]不是连续的'5',若是连续的，数组a[count] no ++

else

{

a[count++] = num;

ant = 1;

num = 0;

}

}

qsort(a, count, sizeof(int), cmp);

printf("%d",a[0]);

for(i=1; i<count; i++)

printf(" %d",a[i]);

printf("\n");

}

return 0;

}