Python实现排列组合生成算法

n = 3 arrange = list(range(1, n + 1)) print(arrange) while 1: for i in range(n - 2, -1, -1): if arrange[i] < arrange[i + 1]: k = i break else: break for i in range(n - 1, 0, -1): if arrange[i] > arrange[k]: l = i break else: break; arrange[k], arrange[l] = arrange[l], arrange[k] temp = arrange[k + 1:] temp.reverse() arrange[k + 1:] = temp print(arrange)