46. Permutations

[nijilong1224]

Given a collection of distinct integers, return all possible permutations.

Example:

Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1] ]

• [x] code submit by yuyang

• [x] code submit by jinglonz

• [ ] discuss

[nijilong1224]

https://github.com/LeeMax117/LeetCode_practise/blob/master/Jinglong/Permutations.py

[LeeMax117]

https://github.com/LeeMax117/LeetCode_practise/blob/master/LeeMax/46_Permutations.py