algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

剑指Offer 58 - 不使用额外空间的JS解法

Browse Source
This commit is contained in:
BarneyShi
2021-10-12 23:06:12 -07:00
parent 7bb935cfaa
commit 7484ba1e00
1 changed files with 8 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
problems/剑指Offer58-II.左旋转字符串.md
View File

@ -200,17 +200,14 @@ func reverse(b []byte, left, right int){
JavaScript： JavaScript：
```javascript ```javascript
var reverseLeftWords = function (s, n) { var reverseLeftWords = function(s, n) {
const reverse = (str, left, right) => { const length = s.length;
let strArr = str.split(""); let i = 0;
for (; left < right; left++, right--) { while (i < length - n) {
[strArr[left], strArr[right]] = [strArr[right], strArr[left]]; s = s[length - 1] + s;
} i++;
return strArr.join(""); }
} return s.slice(0, length);
s = reverse(s, 0, n - 1);
s = reverse(s, n, s.length - 1);
return reverse(s, 0, s.length - 1);
}; };
``` ```