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

Merge pull request #943 from jxxiao/master

Browse Source 
修复 0077.组合 python未剪枝和剪枝代码一样的问题
This commit is contained in:
程序员Carl
2021-12-19 11:35:12 +08:00
committed by GitHub
parent d89b396aee 8614090773
commit 7bcd716d91
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0077.组合.md
View File

@ -405,7 +405,7 @@ class Solution:
if len(path) == k: if len(path) == k:
res.append(path[:]) res.append(path[:])
return return
for i in range(StartIndex, n-(k-len(path)) + 2): for i in range(StartIndex, n + 1):
path.append(i) path.append(i)
backtrack(n, k, i+1) backtrack(n, k, i+1)
path.pop() path.pop()
@ -414,7 +414,7 @@ class Solution:
``` ```
剪枝： 剪枝：
```python3 ```python
class Solution: class Solution:
def combine(self, n: int, k: int) -> List[List[int]]: def combine(self, n: int, k: int) -> List[List[int]]:
res=[] #存放符合条件结果的集合 res=[] #存放符合条件结果的集合
@ -423,7 +423,7 @@ class Solution:
if len(path) == k: if len(path) == k:
res.append(path[:]) res.append(path[:])
return return
for i in range(startIndex,n-(k-len(path))+2): #优化的地方 for i in range(startIndex,n - (k - len(path)) + 2): #优化的地方
path.append(i) #处理节点 path.append(i) #处理节点
backtrack(n,k,i+1) #递归 backtrack(n,k,i+1) #递归
path.pop() #回溯，撤销处理的节点 path.pop() #回溯，撤销处理的节点