"<i>Find the possible routes using Recursion in Python.<\/i>在 Python 中使用递归查找可能的路线。<\/b> <i>Note [ I need this to be done without any module]<\/i>注意[我需要在没有任何模块的情况下完成此操作]<\/b>"

Question

locations = ["loc1", "loc2", "loc3", "loc4", "loc5"]

假设这是一些给定位置的列表，现在我要进行所有可能的安排，但要确保所有安排都应与loc1在固定位置。 e. G

["loc1", "loc3", "loc2", "loc4", "loc5"]
["loc1", "loc3", "loc4", "loc2", "loc5"]

等等..你能告诉我这个使用递归函数的特定问题的算法是什么样子的吗？

Answer 1

您可以使用itertools.permutations<\/code><\/a>来做到这一点：

from itertools import permutations
locations = ["loc1", "loc2", "loc3", "loc4", "loc5"]

permutated_locations = [[locations[0]] + list(i) for i in permutations(locations[1:])]

for l in permutated_locations:
    print(l)