迄今最短用时T_T
class Solution {
public:
string reverseString(string s) {
int n = s.size();
string t=s;
for (int i = 0; i < n; i++)
{
if (i <= (n - i - 1))
{
s[i] = s[n - i - 1];
s[n - i - 1] = t[i];
}
else break;
}
return s;
}
};
执行用时: 8 ms, 在Reverse String的C++提交中击败了97.78% 的用户