给定一个字符串 s 和一个整数 k,从字符串开头算起,每计数至 2k 个字符,就反转这 2k 字符中的前 k 个字符。
如果剩余字符少于 k 个,则将剩余字符全部反转。
如果剩余字符小于 2k 但大于或等于 k 个,则反转前 k 个字符,其余字符保持原样。
Given a string s and an integer k, reverse the first k characters for every 2k characters counting from the start of the string.
If there are fewer than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and leave the other as original.
示例 1:
输入:s = "abcdefg", k = 2
输出:"bacdfeg"
示例 2:
输入:s = "abcd", k = 2
输出:"bacd"
提示:
1 <= s.length <= 104
s 仅由小写英文组成
1 <= k <= 104
根据题意:
将 i 到 i + k (不超出字符串)进行翻转,以每2k是一段,所以循环时,跨度应该是i+=2*k
根据
- 如果剩余字符少于 k 个,则将剩余字符全部反转。
- 如果剩余字符小于 2k 但大于或等于 k 个,则反转前 k 个字符,其余字符保持原样。
可以得i + k > len时,翻转 i 到 len
var reverseStr = function (s, k) {
let len = s.length
let list = Array.from(s)
for (let i = 0; i < len; i += 2 * k) {
let left = i,
right = i + k > len ? len - 1 : i + k - 1
while (left < right) {
[list[left], list[right]] = [list[right], list[left]]
++left;
--right;
}
}
return list.join("")
};
将代码优化
var reverseStr = function (s, k) {
let len = s.length
let list = Array.from(s)
for (let i = 0; i < len; i += 2 * k) {
let left = i-1,
right = i + k > len ? len : i + k
while (++left < --right) {
[list[left], list[right]] = [list[right], list[left]]
}
}
return list.join("")
};