Task: 思路: 亦或的思路; 代码: class Solution { public: void reverseString(vector<char>& s) { for(int i = 0; i < s.size()/2; ++i){ s[i] ^= s[s.size()-1-i]; s[s.size()-1-i] ^= s[i]; s[i] ^= s[s.size()-1-i]; } return; } }; 提交结果: