【每日面试题】字符串的顺序变化

int findXing(char *str)
{
int len=strlen(str);
int count=0;
int i=len-1;
int j=len-1;
while(i>=0)
{
if(str[i]!='*')
{
char a=str[i];
str[i]=str[j];
str[j]=a;
i--;
j--;
}
else
{
i--;
count++;
}
}
return count;
}
int main()
{
char m[]="abcd**ad";
int f=findXing(m);
printf("%d\n",f);
return 0;
}