【自留笔记】排列组合

rain_ check

已于 2023-04-02 17:08:24 修改

阅读量41

点赞数

文章标签：深度优先算法 python

于 2023-04-01 22:06:09 首次发布

本文链接：https://blog.csdn.net/momo_1728/article/details/129903912

版权


#全排列 1~n中选m个数全排列
def dfs(path,n,m):
    if len(path) == m:
        print(path)
        return
    for i in range(1,n+1):
        if i in path:
            continue
        path.append(i)
        dfs(path,n,m)
        path.pop()

n,m = map(int,input().split())
dfs([],n,m)

#递归组合 1~n中选m个数 组合
n,m = map(int,input().split())

def dfs(start,path,n,m):
    if len(path) == m:
        for item in path:
            print(item, end=" ")
        print()
        return
        
    for i in range(start,n+1):
        if i in path:
            continue
        path.append(i)
        dfs(i+1,path,n,m)
        path.pop()

dfs(1,[],n,m)


#非递归组合
n,m = map(int,input().split())
li = []
for i in range(1,n+1):
    li.append(i)
    j = i + 1
    while li:
        if len(li) == m:
            print(li)
            li.pop()
        elif j not in li and j <= n:
            li.append(j)
            j += 1
            continue
        elif j > n:
            j = li[-1] + 1
            li.pop()