给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例:
输入:"Let's take LeetCode contest"
输出:"s'teL ekat edoCteeL tsetnoc"答:
class Solution {
public:
string reverseWords(string s) {
s += ' ';
int len = s.length();
for(int i=0, b=0; i<len; ++i) {
if(s[i] ==' ' ) {
reverse(s.begin()+b, s.begin()+i);
b = i+1;
}
}
s.pop_back();
return s;
}
};