面试字符串处理之单词翻转

<p align="left">分析：第一步，将字符串完全倒置，即".gnijnan morf emoc i"

<p align="left">实现一：

<p align="left">#include <string.h><br>
#include <stdlib.h><br>
char * convert (char* pure)<br>
{<br><br><br>
char *temp=(char *)malloc(strlen(pure)+1);<br>
int i=0;<br>
int j=strlen(pure);<br>
int pre=0;<br>
int k=0;<br>
temp[j]='\0';<br>
for (i=0;i<strlen(pure);i++)<br>
{<br>
temp[--j]=pure[i];//字符串反转<br>
}<br>
for(i=0;i<strlen(temp);i++)<br>
{<br>
if(temp[i]==' ')<br>
{<br>
k=i;<br>
for(j=pre;j<i;j++)<br>
pure[j]=temp[--k];<br>
pure[j]=' ';<br>
pre=i+1;<br>
}<br>
if(i==(strlen(temp)-1))<br>
{<br>
k=i;<br>
for(j=pre;j<=i;j++)<br>
pure[j]=temp[k--];<br>
}<br>
}<br>
return pure;<br>
}<br>
int main(int argc, char* argv[])<br>
{<br>
char a[]="am loving you baby";<br>
convert(a);<br>
printf("%s\n",a);<br>
return 0;

<p align="left">实现二：（较为清楚的实现）

#include <string.h><br>
void strReverse(char *str,int n)<br>
{<br>
int i = 0;<br>
int j = 0;<br>
int begin;<br>
int end;<br>
char temp;<br><br>
//...............第一步：整体倒置......................//<br>
j = n-1;<br>
while (j>i)<br>
{<br>
temp = str[i];<br>
str[i] = str[j];<br>
str[j] = temp;<br>
i++;<br>
j--;<br>
}<br>
printf("after reversing wholly string = %s\n",str);<br>
//...............第二步:按单词部分倒置......................//<br>
i = 0;<br>
while (str[i]!='\0')<br>
{<br>
if (str[i]!=' ')<br>
{<br>
begin = i;<br>
while ((str[i]!='\0') && (str[i]!=' '))<br>
{<br>
i++;<br>
}<br>
i = i-1;<br>
end = i;<br>
}<br>
while (begin<end)<br>
{<br>
temp = str[begin];<br>
str[begin] = str[end];<br>
str[end] = temp;<br>
begin++;<br>
end--;<br>
}<br>
i++;<br>
}<br>
}<br>
int main()<br>
{<br><br>
char str[] = "i come from nanjing.";<br>
int j = 0;<br><br>
j = strlen(str);<br>
printf(" string = %s\n",str);<br>
strReverse(str,j);<br>
printf(" string = %s\n",str);<br>
return 0;<br>
}