class Solution
{
public:
void Reverse(string& s, int start, int end)
{
end--;
while (start < end)
{
swap(s[start], s[end]);
start++;
end--;
}
}
string reverseStr(string s, int k)
{
int len = s.size();
for (int i = 0; i < len; i += 2 * k)
{
if (i + k < len)
Reverse(s, i, i + k);
else
Reverse(s, i, len);
}
return s;
}
};
541. 反转字符串 II
最新推荐文章于 2024-05-21 19:54:20 发布