LeetCode No.46 Permutations

Given a collection of distinct numbers, return all possible permutations.數組 For example, [1,2,3] have the following permutations: spa [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]
相關文章
相關標籤/搜索