leetcode: 46. Permutations

Problem

# Given a collection of distinct numbers, return all possible permutations.
#
# For example,
# [1,2,3] have the following permutations:
# [
#     [1,2,3],
#     [1,3,2],
#     [2,1,3],
#     [2,3,1],
#     [3,1,2],
#     [3,2,1]
# ]

Idea

当只有1时候：[1]
当加入2以后：[2, 1], [1, 2]
当加入3以后：[3, 2, 1], [2, 3, 1], [2, 1, 3], [3, 1, 2], [1, 3, 2], [1, 2, 3]
前3个permutation分别对应将3插入[2, 1]的0, 1, 2的位置。
同理后3个为插入[1, 2]的。因此可以用逐个插入数字来构造所有permutations。

AC

DFS：

class Solution():
    def permute(self, x):
        return self.dfs(x)
    def dfs(self, x):
        if len(x) == 0:
            return []
        if len(x) == 1:
            return [x]
        pre, cur = self.dfs(x[:-1]), []
        for p in pre:
            for i in range(len(x)):
                cur.append(p[:i] + [x[-1]] + p[i:])
        return cur


if __name__ == "__main__":
    assert Solution().permute([1, 2, 3]) == [[3, 2, 1], [2, 3, 1], [2, 1, 3], [3, 1, 2], [1, 3, 2], [1, 2, 3]]