class Solution {
public:
void reverseString(vector<char>& s) {
int n = s.size();
int left = 0, right = n - 1;
int tmp;
while (left < right)
{
tmp = s[left];
s[left] = s[right];
s[right] = tmp;
left++;
right--;
}
return;
}
};
344. 反转字符串class Solution {public: void reverseString(vector<char>& s) { int n = s.size(); int left = 0, right = n - 1; int tmp; while (left < right) { tmp = s[left]; s[left