//压缩空格后的字符串长度
int deleteKong(char s[],int n)
{
int i=0,j=0;
for(i=0;i<n;++i)
{
if(s[i]==' ')
{
while(s[++i]==' ')
continue;
s[j++]=s[--i];
}
else
{
s[j++]=s[i];
}
}
s[j]='\0';
return j;
}
//子串逆转
void change(char s[],int start,int end)
{
char t;
while(start<end)
{
t=s[start];
s[start]=s[end];
s[end]=t;
start++;
end--;
}
}
int main()
{
int n,i,start,end;
char a[100001];
while(scanf("%d",&n)!=EOF&&n!=0)
{
while (getchar()!='\n')
continue;
gets (a);
n=deleteKong(a,n);
for(i=0;i<n;++i)
{
if(a[i]!=' ')
{
start = i;
while(++i<n&&a[i]!=' ')
continue;
end = i-1;
change(a,start,end);
}
}
puts(a);
}
return 0;
}
九度OJ 1125
猜你喜欢
转载自blog.csdn.net/LiuJiuXiaoShiTou/article/details/78606190
今日推荐
周排行