LeetCode 78. 子集

Categories:

题目描述
思路分析
参考代码
相似题目

题目描述

🔥 78. 子集

思路分析

思路描述

参考代码

func subsets(nums []int) [][]int {
	var res [][]int
	sort.Ints(nums)
	backtrack(nums, &res, []int{}, 0)
	return res
}

func backtrack(nums []int, res *[][]int, path []int, start int) {
	temp := make([]int, len(path))
	copy(temp, path)
	*res = append(*res, temp)

	for i := start; i < len(nums); i++ {
		path = append(path, nums[i])
		backtrack(nums, res, path, i+1)
		path = path[:len(path)-1]
	}
}

🍏 点击查看 Java 题解

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> res = new ArrayList<>();
        Arrays.sort(nums);
        backtrack(nums, new ArrayList<>(), res, 0);
        return res;
    }

    public void backtrack(int[] nums, List<Integer> path, List<List<Integer>> res, int start) {
        res.add(new ArrayList<>(path));
        for (int i = start; i < nums.length; i++) {
            if (i > start && nums[i] == nums[i - 1]) {
                continue;
            }
            path.add(nums[i]);
            backtrack(nums, path, res, i + 1);
            path.remove(path.size() - 1);
        }
    }
}

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> res = new ArrayList<>();
        backtrack(nums, new ArrayList<>(), res, 0);
        return res;
    }

    public void backtrack(int[] nums, List<Integer> path, List<List<Integer>> res, int start) {
        res.add(new ArrayList<>(path));
        for (int i = start; i < nums.length; i++) {
            path.add(nums[i]);
            backtrack(nums, path, res, i + 1);
            path.remove(path.size() - 1);
        }
    }
}

相似题目

题目	难度	题解
子集 II	Medium
列举单词的全部缩写	Medium
字母大小写全排列	Medium

本文作者: HGNULB

本文链接: https://hgnulb.github.io/blog/26448849