[字符串][递归][双指针]leetcode344：反转字符串(easy)

递归][双指针]leetcode344：反转字符串(easy)"/>

[字符串][递归][双指针]leetcode344：反转字符串(easy)

题目：

题解：

class Solution {
public://解法1：双指针法void reverseString_1(vector<char>& s) {int i=0,j=s.size()-1;//双指针，两端同时向中间移动while(i<j){swap(s[i],s[j]);++i;--j;}}//解法2：递归法void reverseString(vector<char>& s){reverseString(s,0,s.size()-1);}void reverseString(vector<char>& s,int i,int j){//1:递归边界if(i>=j)return;//2:递归式swap(s[i],s[j]);reverseString(s,i+1,j-1);}//解法3：STL算法void reverseString_3(vector<char>& s){reverse(s.begin(),s.end());}
};