LEETCODE: Reverse Words in a String
2015-01-13 14:20
405 查看
Given an input string, reverse the string word by word.
For example,
Given s = "
return "
click to show clarification.
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.
class Solution {
public:
void reverseWords(string &s) {
// Skip the spaces on the left
int pos = 0;
for(; pos < s.length(); pos ++) {
if(s[pos] != ' ')
break;
}
string result;
string word;
for(; pos < s.length(); pos ++) {
// If is space, check if we have word. Have, record it. Not have, skip.
if(s[pos] == ' ') {
if(word.length() != 0) {
if(!result.empty())
result = " " + result;
result = word + result;
word.clear();
}
}
else {
word += s[pos];
}
}
if(word != "") {
if(!result.empty())
result = " " + result;
result = word + result;
}
if(result.length() != 0) {
if(result[0] == ' ') {
s = result.substr(1);
return;
}
}
s = result;
}
};
For example,
Given s = "
the sky is blue",
return "
blue is sky the".
click to show clarification.
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.
class Solution {
public:
void reverseWords(string &s) {
// Skip the spaces on the left
int pos = 0;
for(; pos < s.length(); pos ++) {
if(s[pos] != ' ')
break;
}
string result;
string word;
for(; pos < s.length(); pos ++) {
// If is space, check if we have word. Have, record it. Not have, skip.
if(s[pos] == ' ') {
if(word.length() != 0) {
if(!result.empty())
result = " " + result;
result = word + result;
word.clear();
}
}
else {
word += s[pos];
}
}
if(word != "") {
if(!result.empty())
result = " " + result;
result = word + result;
}
if(result.length() != 0) {
if(result[0] == ' ') {
s = result.substr(1);
return;
}
}
s = result;
}
};
相关文章推荐
- Leetcode 第151题 最新题解 Reverse Words in a String
- leetcode JAVA Reverse Words in a String 难度系数2-3?最新题151
- LeetCode(151)Reverse Words in a String
- Leetcode: Reverse Words in a String
- LeetCode Reverse Words in a String
- 【LeetCode with Python】 Reverse Words in a String
- [LeetCode]Reverse Words in a String
- leetcode Reverse Words in a String
- [leetcode]Reverse Words in a String
- Leetcode_Reverse-Words-in-a-String
- LeetCode | Reverse Words in a String
- Reverse Words in a String (LeetCode)
- [Leetcode Solution] Reverse Words in a String
- LeetCode151:Reverse Words in a String
- 【LeetCode】Reverse Words in a String
- [leetCode]Reverse Words in a String
- leetcode - Reverse Words in a String
- [LeetCode] Reverse Words in a String
- 【LeetCode】Reverse Words in a String
- 【LeetCode】Reverse Words in a String