class Solution {
public:
/*反转区间为前n的子串
反转区间为n到末尾的子串
反转整个字符串*/
void reverse(string& s, int start, int end){
for (int i = start, j = end ; i < j; i++, j--){
swap(s[i], s[j]);
}
}
string reverseLeftWords(string s, int n) {
reverse(s, 0, n - 1);
reverse(s, n, s.size() - 1);
reverse(s, 0, s.size() - 1);
return s;
}
};