250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록permutation (1)
N
(LeetCode JS)Permutation
46. Permutations Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Example 1: Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Example 2: Input: nums = [0,1] Output: [[0,1],[1,0]] Example 3: Input: nums = [1] Output: [[1]] Constraints: 1
Leet Code 알고리즘
2021. 9. 20. 10:35