(nums, subsets = [[]])
| 42 | }; |
| 43 | |
| 44 | const bfs = (nums, subsets = [[]]) => { |
| 45 | let levels = subsets.length - 1; |
| 46 | |
| 47 | for (let i = 0; i < nums.length; i++) { |
| 48 | const isPrevDuplicate = 0 < i && nums[i - 1] === nums[i]; |
| 49 | const start = isPrevDuplicate ? levels + 1 : 0; |
| 50 | |
| 51 | levels = subsets.length - 1; |
| 52 | |
| 53 | for (let level = start; level < levels + 1; level++) { |
| 54 | const nextLevel = [...subsets[level], nums[i]]; |
| 55 | |
| 56 | subsets.push(nextLevel); |
| 57 | } |
| 58 | } |
| 59 | |
| 60 | return subsets; |
| 61 | }; |