Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue
",
return "blue is sky the
".
Update (2015-02-12):
For C programmers: Try to solve it in-place in O(1) space.
Clarification:
- What constitutes a word?
A sequence of non-space characters constitutes a word. - Could the input string contain leading or trailing spaces?
Yes. However, your reversed string should not contain leading or trailing spaces. - How about multiple spaces between two words?
Reduce them to a single space in the reversed string.
解题技巧:
该题要求将字符串翻转,并删除句首的空格、句尾的空格、重复的空格。因此,可以先对字符串进行预处理删除多余的空格,然后对句子整体进行一次翻转,之后,对句中的每个单词进行翻转。
代码:
#include <iostream>
#include <string>
using namespace std;
void removespace(string &s)
{
int len = s.size();
bool isspace = 0;
int k = 0;
if(s[0] == ' ') isspace = 1;
for(int i = 0; i < len; i++)
{
if(s[i] != ' ')
{
s[k] = s[i];
k ++;
isspace = 0;
}
else
{
if(isspace) continue;
else
{
isspace = 1;
s[k] = s[i];
k ++;
}
}
}
if (isspace == 1 && k) k --;
s.resize(k);
}
void reverseWords(string &s, int bg, int ed)
{
for(int i = bg, j = ed; i < j; i ++, j --)
{
char c = s[i];
s[i] = s[j];
s[j] = c;
}
}
void reverseWords(string &s)
{
if(s.size() == 0) return;
int len;
removespace(s);
len = s.size();
reverseWords(s, 0, len - 1);
int bg = 0, ed;
for(int i = 0; i < len; i ++)
{
if(s[i] == ' ' || i == len - 1)
{
if(i == len - 1) ed = i;
else ed = i - 1;
reverseWords(s, bg, ed);
bg = i + 1;
}
}
}
int main()
{
string s;
getline(cin, s);
reverseWords(s);
cout<<s<<endl;
}