题目链接:力扣
代码:
class Solution {
public:
void reverseString(vector<char>& s) {
for (int i = 0, j = s.size() - 1; i < s.size()/2; i++, j--) {
swap(s[i],s[j]);
}
}
};
swap的实现。
int tmp = s[i];
s[i] = s[j];
s[j] = tmp;
个人想法:
嗯..凑个文章,排着好看