[leet code] Permutations - 伪技回忆录 - 博客频道 - CSDN.NET

[leet code] Permutations - 伪技回忆录 - 博客频道 - CSDN.NET

Given a collection of 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], and [3,2,1].

Read full article from [leet code] Permutations - 伪技回忆录 - 博客频道 - CSDN.NET