《LeetCode力扣练习》代码随想录——回溯算法(子集—Java)
刷题思路来源于 代码随想录
78. 子集
-
回溯
class Solution { private List<Integer> path = new ArrayList<>(); private List<List<Integer>> result = new ArrayList<>(); public List<List<Integer>> subsets(int[] nums) { backtrack(nums, 0); return result; } private void backtrack(int[] nums, int startIndex) { result.add(new ArrayList<>(path)); if (startIndex == nums.length) { return; } for (int i = startIndex; i < nums.length; i++) { path.add(nums[i]); backtrack(nums, i + 1); path.remove(path.size() - 1); } return; } }