(nums, i, permutation, permutations)
| 22 | }; |
| 23 | |
| 24 | const backTrack = (nums, i, permutation, permutations) => { |
| 25 | permutation.push(nums[i]); |
| 26 | dfs(nums, permutation, permutations); |
| 27 | permutation.pop(); |
| 28 | }; |
| 29 | |
| 30 | /** |
| 31 | * https://leetcode.com/problems/permutations/solution/ |