题目大意:请编写一个函数来颠倒单词在字符串中的出现顺序。比如:“thank you very much”将变为“much very you thank”。
思路跟之前的删除特定字符差不多,逆向遍历字符串,并新建一个数组用来存储改变的字符串,代码如下:
#include <iostream>
#include <string.h>
using namespace std;
void UpsideDownString(char *str)
{
int i,j,k = 0;
int len = strlen(str);
char copy_str[len];
int index = len - 1;
for(i = len - 1;i >= 0;i--)
{
if(i == 0)
{
for(j = i;j <= index;j++)
{
copy_str[k++] = str[j];
}
}
if(str[i] == ' ')
{
for(j = i + 1;j <= index;j++)
{
copy_str[k++] = str[j];
}
copy_str[k++] = ' ';
index = i - 1;
i = index - 1;
}
}
for(i = 0;i < len;i++)
{
cout<<copy_str[i];
}
cout<<endl;
}
int main()
{
char *str = "thank you very much";
UpsideDownString(str);
}