题目连接:Leetcode 344 Reverse String
解题思路:遍历一半字符串,收尾互换。
class Solution {
public:
string reverseString(string s) {
int n = s.size();
string ret = s;
for (int i = 0; i < n; i++)
ret[i] = s[n-i-1];
return ret;
}
};
题目连接:Leetcode 344 Reverse String
解题思路:遍历一半字符串,收尾互换。
class Solution {
public:
string reverseString(string s) {
int n = s.size();
string ret = s;
for (int i = 0; i < n; i++)
ret[i] = s[n-i-1];
return ret;
}
};