From 3e5c1705c2cda8cdb6acd9c7581b16d81fd4b77d Mon Sep 17 00:00:00 2001
From: qiufeihong2018 <15058301288@163.com>
Date: Wed, 1 May 2024 16:08:36 +0800
Subject: [PATCH] =?UTF-8?q?refactor:=200077.=E7=BB=84=E5=90=88.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 "problems/0077.\347\273\204\345\220\210.md" | 26 +++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git "a/problems/0077.\347\273\204\345\220\210.md" "b/problems/0077.\347\273\204\345\220\210.md"
index 103fb627f5..35ed5fad49 100644
--- "a/problems/0077.\347\273\204\345\220\210.md"
+++ "b/problems/0077.\347\273\204\345\220\210.md"
@@ -469,6 +469,32 @@ func dfs(n int, k int, start int) {
 ```
 
 ### Javascript
+未剪枝：
+
+```js
+var combine = function (n, k) {
+  // 回溯法
+  let result = [],
+    path = [];
+  let backtracking = (_n, _k, startIndex) => {
+    // 终止条件
+    if (path.length === _k) {
+      result.push(path.slice());
+      return;
+    }
+    // 循环本层集合元素
+    for (let i = startIndex; i <= _n; i++) {
+      path.push(i);
+      //   递归
+      backtracking(_n, _k, i + 1);
+      //   回溯操作
+      path.pop();
+    }
+  };
+  backtracking(n, k, 1);
+  return result;
+};
+```
 
 剪枝：