反转字符串 题目链接 解题思路 双指针算法两个指针向中间靠拢,直至相遇交换两个指针的值 class Solution { public: void reverseString(vector<char>& s) { int l = 0; int r = s.size()-1; while(l < r){ char temp = s[l]; s[l] = s[r]; s[r] = temp; l++; r--; } } };