LeetCode Top 100 Liked Questions 46. Permutations (Java版; Medium)
题目描述
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]
]
LeetCode Top 100 Liked Questions 46. Permutations (Java版; Medium)
welcome to my blogLeetCode Top 100 Liked Questions 46. Permutations (Java版; Medium)题目描述Given a collection of distinct integers, return all possible permutations.Example:Input: [1,2,3]Output:[...