Given an input string, reverse the string word by word. A word is defined as a sequence of non-space characters.
The input string does not contain leading or trailing spaces and the words are always separated by a single space.
For example,
Given s = "
return "
Given s = "
the sky is blue
",return "
blue is sky the
".
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Solution { | |
public: | |
void reverseWords(string &s){ | |
reverse(s.begin(), s.end()); | |
auto l=s.begin(); | |
auto r=s.begin(); | |
while(l!=s.end()){ | |
while(*r!=' '&& r!=s.end()) | |
r++; | |
reverse(l, r); | |
l=r+1; | |
if(r==s.end()) | |
break; | |
else | |
r++; | |
} | |
} | |
}; |
No comments:
Post a Comment