fix: 修复问题

Author: wangjieCode

package-lock.json

@@ -23,6 +23,7 @@
     "@babel/preset-env": "^7.14.4",
     "babel-jest": "^27.0.2",
     "babel-plugin-transform-es2015-modules-commonjs": "^6.26.2",
+    "esno": "^0.16.3",
     "jest": "^27.0.3",
     "nodemon": "^2.0.7"
   },

package.json

@@ -0,0 +1,34 @@
+
+
+// [1,2,3]
+// return [[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]
+
+
+function permute(nums: number[]): number[][] {
+
+    const res: number[][] = []; // 存储结果
+    const paths: number[] = []; // 存储下标
+    const used: boolean[] = []; // 存储是否使用过
+    permuteHelper(nums, 0, paths, used, res);
+    return res;
+}
+
+function permuteHelper (nums: number[], depth: number, paths: number [], used: boolean [], res: number[][]) {
+    if(nums.length === depth) {
+        console.log(paths);
+        res.push(paths);
+        return;
+    }
+    for(let i = 0; i < nums.length; i++) {
+        if(used[i]) {
+            continue;
+        }
+        paths.push(nums[i]);
+        used[i] = true;
+        permuteHelper(nums, depth + 1, paths, used, res);
+        paths.pop();
+        used[i] = false;
+    }
+}
+
+ console.log( permute([1,2,3]) )

回溯/全排列.ts

@@ -0,0 +1,28 @@
+
+
+// 选括号
+// {{{}}}
+
+
+function generateParenthesis(n: number): string[] {
+    if (n < 1) return [];
+    const res: string[] = [];
+    dfs('', 0, n, res)
+    return res;
+};
+
+function dfs(cur: string, start, depth = 0, res) {
+    if (depth === 0) {
+        res.push(cur);
+        return;
+    } else {
+        // cur[start] = '(';
+        // dfs(current, pos + 1, result);
+        // current[pos] = ')';
+        // dfs(current, pos + 1, result);
+    }
+   
+}
+
+console.log(
+    generateParenthesis(2))