添加全排列

Author: wabiwabo

20.有效的括号.js

@@ -0,0 +1,30 @@
+/*
+ * @lc app=leetcode.cn id=20 lang=javascript
+ *
+ * [20] 有效的括号
+ */
+
+// @lc code=start
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isValid = function (s) {
+    const map = new Map();
+    map.set(")", "(")
+    map.set("]", "[")
+    map.set("}", "{")
+
+    const stack = [];
+    for (let i of s) {
+        if (map.has(i)) {
+            const current = stack.pop();
+            if (current !== map.get(i)) return false;
+        } else {
+            stack.push(i);
+        }
+    }
+    return stack.length === 0;
+};
+// @lc code=end
+

46.全排列.ts

@@ -0,0 +1,31 @@
+/*
+ * @lc app=leetcode.cn id=46 lang=typescript
+ *
+ * [46] 全排列
+ */
+
+// @lc code=start
+function permute(nums: number[]): number[][] {
+    const res:number[][] = [];
+    const path: number[] = [];
+    const visited = new Array(nums.length).fill(false);
+    
+    function DFS(path, visited){
+        if(path.length === nums.length) {
+            res.push([...path]);
+            return
+        }
+        for(let i = 0; i < nums.length;i++){
+            if(visited[i]) continue;
+            path.push(nums[i]);
+            visited[i] = true;
+            DFS(path, visited)
+            path.pop();
+            visited[i] = false;
+        }
+    }
+    DFS(path, visited);
+    return res;
+};
+// @lc code=end
+