LeetCode reverse-words-in-a-string3

给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。 示例 1:

输入: "Let's take LeetCode contest" 输出: "s'teL ekat edoCteeL tsetnoc"

注意:在字符串中,每个单词由单个空格分隔,并且字符串中不会有任何额外的空格。

解答:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public:
string reverseWords(string s) {
int n=s.size();
int begin=0,end;
for(int i=0;i<n+1;i++)
{
if(s[i]==' '||s[i]=='\0')
{
for(end=i-1;begin<end;begin++,end--)
{
swap(s[begin],s[end]);
}
begin=i+1;
}
}

return s;
}
};

Comments

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×