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

纠正 0047.全排列II JS、TS 版本代码

Browse Source 
JS 和 TS 里面 数组深拷贝一般采用 ES6 扩展运算符 ... ，或者 Array.from() 方法，而不会采用实例方法 slice. slice方法用于数组分割等操作，请注意代码书写规范！
This commit is contained in:
Luo
2022-05-21 10:48:51 +08:00
committed by GitHub
parent e07a3caa02
commit 38b10bcbfd
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0047.全排列II.md
View File

@ -268,7 +268,7 @@ var permuteUnique = function (nums) {
function backtracing( used) { function backtracing( used) {
if (path.length === nums.length) { if (path.length === nums.length) {
result.push(path.slice()) result.push([...path])
return return
} }
for (let i = 0; i < nums.length; i++) { for (let i = 0; i < nums.length; i++) {
@ -303,7 +303,7 @@ function permuteUnique(nums: number[]): number[][] {
return resArr; return resArr;
function backTracking(nums: number[], route: number[]): void { function backTracking(nums: number[], route: number[]): void {
if (route.length === nums.length) { if (route.length === nums.length) {
resArr.push(route.slice()); resArr.push([...route]);
return; return;
} }
for (let i = 0, length = nums.length; i < length; i++) { for (let i = 0, length = nums.length; i < length; i++) {