-
Notifications
You must be signed in to change notification settings - Fork 0
/
zifuchuan
59 lines (55 loc) · 1.08 KB
/
zifuchuan
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
using namespace std;
void myReverse(char*, char*);
char * senReverse(char*);
int main()
{
char sen[]="hello, I am a student!";
char *result=senReverse(sen);
cout << result << endl;
return 0;
}
void myReverse(char *start, char *end)
{
char temp;
while(start<end)
{
temp=*start;
*start=*end;
*end=temp;
start++;
end--;
}
}
char * senReverse(char *sen)
{
char *start=sen, *end=sen+strlen(sen)-1;
myReverse(start, end); //先反转整个句子
[cpp]
释部分是另外一种实现,只不过看起来有些繁琐
int loc; //记录每个单词的长度
for(start=sen,end=start;(*end)!='\0';start+=loc)
{
loc=0;
while((*end)!=' '&&(*end)!='\0'){end++, loc++;}
end--;
myReverse(start, end);
end+=2;
loc++;
}
*/
end=start;
while(*start!='\0')
{
if(*end==' '||*end=='\0')
{
myReverse(start, --end);
if(*end=='\0')
break;
end+=2;
start=end;
}
else
++end;
}
return sen;