Givena string, you need to reverse the order of characters in each word within asentence while still preserving whitespace and initial word order.
Example1:
Input: "Let's take LeetCode contest"
Output: "s'teL ekat edoCteeL tsetnoc"
Note: In the string, each word is separated by single space andthere will not be any extra space in the string.
水题,就是在做题的时候要记得尽量写短一点
class Solution {
public:
stringreverseWords(string s) {
string tt = ""; string result ="";
int index = 0;
while (index < s.size())
{
tt = "";
while(index<s.size()&&s[index] != ' ')
{
tt = s[index++]+tt;
}
result += (index++<s.size() ? (tt+' ') :(tt));
}
return result;
}
};
不过假如这样做的话时间会很长,因为这里做了双重string叠加,所以以后在做题的时候要避免string的加法运算,改为使用string的substr运算或者是append都比string的加减要快,比如这一题,可以使用swap来代替string的加减运算,所以会快不少,以后在做题的时候一定要记住,string的加减特别是在for循环里面一个个的加减是一定要避免的,因为很慢!
class Solution {
public:
stringreverseWords(string s) {
string tt = ""; string result ="";
int index = 0; int l,up;
while (index < s.size())
{
size_t up = s.find_first_of(' ',index);
if (up == string::npos)
{
l = s.size() - 1;
}
else
{
l = up-1;
}
while (index < l) {swap(s[index], s[l]); index++; l--; }
index = up==string::npos ?s.size() : up+1;
}
return s;
}
};