说明:转载请注明出处http://blog.csdn.net/yuanwei1314/article/details/40746871
输入一个英文句子,翻转句子中单词的顺序,但单词内字符的顺序不变,句子中单词以空格符隔开。为简单起见,标点符号和普通字母一样处理。例如,输入“I am a student.”,则输出“student. a am I”。
思路一:翻转整个字符串然后对每个字符串翻转即可。
#include <stdio.h>
#include <stdlib.h>
/*将字符串从low到high翻转*/
void reverse(char *s, int low, int high)
{
char tmp;
while (low <= high)
{
tmp = *(s+low);
*(s+low) = *(s+high);
*(s+high) = tmp;
low++;
high--;
}
}
int reverseWord(char *s)
{
int i = 0;
int j = 0;
/*先翻转整个句子*/
reverse(s, 0, strlen(s)-1);
printf("Test :%s\n", s);
/*翻转单个单词*/
while (*(s+i) != '\0')
{
if (*(s+i) == ' ')
{
reverse(s, j, i-1);
i++;
j = i;
}
i++;
}
}
int main()
{
char s[] = "I am a student.";
reverseWord(s);
printf("%s\n", s);
return 0;
}
时间复杂度O(n),空间复杂度O(1).
思路二:递归求解同样是满足时间复杂度O(n),空间复杂度O(1).
#include <stdio.h>
#include <stdlib.h>
void reverse(char *s)
{
char tmp[20];
int i = 0;
while (*s!='\0' && *s!=' ')
{
tmp[i++] = *(s++);
}
tmp[i] = '\0';
if (*s!='\0')
{
s++;
}
else
{
printf("%s", tmp);
return;
}
reverse(s);
printf(" %s", tmp);
}
void main()
{
char s[] = "I am a student.";
reverse(s);
printf("\n");
}