class Solution(object):
def combine(self,n,k):
ans=[]
nums=[i+1 for i in range(n)]
def dfs(last,now):
if len(now)==k:
ans.append(now)
for i in range(len(last)):
dfs(last[i+1:],now+[last[i]])
dfs(nums,[])
return ans
组合python
最新推荐文章于 2024-08-14 17:18:35 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)