1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
| class Solution {
public:
string reverseLeftWords(string s, int n) {
reverse(s, 0, s.size() - 1);
reverse(s, 0, s.size() - n - 1);
reverse(s, s.size() - n, s.size() - 1);
return s;
}
private:
void reverse(string& s, int start, int end)
{
while(start < end)
swap(s[start++], s[end--]);
}
};
|