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

fix Qn0077 python indent

Browse Source
This commit is contained in:
tlylt
2022-01-01 11:17:07 +08:00
parent a936850fb7
commit 082302078b
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0077.组合.md
View File

@ -422,7 +422,7 @@ class Solution:
def backtrack(n,k,startIndex): def backtrack(n,k,startIndex):
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) #递归

2
problems/0077.组合优化.md
View File

@ -182,7 +182,7 @@ class Solution:
def backtrack(n,k,startIndex): def backtrack(n,k,startIndex):
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) #递归