题目: 代码: class Solution { public: void reverseString(vector<char>& s) { int n=s.size(); for(int i=0;i<n/2;i++) { if(s[i]==s[n-1-i]) continue; char temp=s[i]; s[i]=s[n-1-i]; s[n-1-i]=temp; } } }; 补充: