LeetCode 刷题记录 78. Subsets

最新推荐文章于 2020-01-13 22:01:18 发布
最新推荐文章于 2020-01-13 22:01:18 发布
阅读量88 收藏
点赞数
分类专栏： LeetCode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/dldldl1994/article/details/103002025
版权

题目：
Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
解法1：
回溯法
c++：
与平常的回溯法相比，直接没有判断条件，直接加入path，且没有return语句

res.push_back(path);

nums = [1,2,3]
在这里插入图片描述

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res;
        vector<int> path;
        DFS(nums, path, res, 0);
        return res;
    }
    void DFS(vector<int>& nums, vector<int>& path,vector<vector<int>>& res,int start){
        
        
        res.push_back(path);
        
        
        for(int i = start; i < nums.size(); ++i){
            path.push_back(nums[i]);
            DFS(nums, path, res, i+1);
            path.pop_back();
        }
        
    }
};

java;

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

    }
    private void DFS(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]);
            DFS(nums, path, res, i+1);
            path.remove(path.size() - 1);
        }
        
    }
}

python：

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        res = []
        self.DFS(nums, [], res, 0)
        return res
    def DFS(self, nums, path, res,start):
        
        
        res.append(path)
            
        for i in xrange(start, len(nums)):
           
            self.DFS(nums, path + [nums[i]], res, i+1)

解法2：
回溯法变体
对每一个元素都有选择或者不选择，不选择则不添加，所有的元素都加完即得到结果

					    []        
                   /          \        
                  /            \     
                 /              \
              [1]                []
           /       \           /    \
          /         \         /      \        
       [1 2]       [1]       [2]     []
      /     \     /   \     /   \    / \
  [1 2 3] [1 2] [1 3] [1] [2 3] [2] [3] []

图来自：[LeetCode] 78. Subsets 子集合

c++：

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res;
        vector<int> path;
        DFS(nums, path, res, 0);
        return res;
    }
    void DFS(vector<int>& nums, vector<int>& path,vector<vector<int>>& res,int start){
        
        if(start == nums.size()){
            res.push_back(path);
            return;
        }
        
        
        
        DFS(nums, path, res, start+1);
        path.push_back(nums[start]);
        DFS(nums, path, res, start+1);
        path.pop_back();
        
        
    }
};

java:

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

    }
    private void DFS(int[] nums, List<Integer> path,List<List<Integer>> res,int start){
        
       
        if(start == nums.length){
            res.add(new ArrayList<>(path));
            return;
        }
        
        
        
        DFS(nums, path, res, start+1);
        path.add(nums[start]);
        DFS(nums, path, res, start+1);
        path.remove(path.size() - 1);
       
        
    }
}

python:

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        res = []
        self.DFS(nums, [], res, 0)
        return res
    def DFS(self, nums, path, res,start):
        
        if start == len(nums):
            res.append(path)
            return
        
        
        
        
        
        
            
        
        self.DFS(nums, path, res, start+1)
        self.DFS(nums, path + [nums[start]], res, start+1)

解法3：
迭代法
初始化首先为空集合，然后每一次复制结果中的元素，然后再原有的集合中加入新元素
在这里插入图片描述
c++：

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res = {{}};
        for(int num : nums){
            int size = res.size();
            for(int i = 0; i < size; i++){
                res.push_back(res[i]);
                res.back().push_back(num);
            }
        }
        return res;
    }
    
};

java：

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>>  res = new ArrayList<>();
        res.add(new ArrayList<>());
        for(int num : nums){
            int size = res.size();
            for(int i = 0; i < size; i++){
                res.add(new ArrayList<>(res.get(i)));
                res.get(res.size()-1).add(num);
            }
        }
        return res;

    }
   
}

python：

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        res = [[]]
        for num in nums:
            res += [ r + [num] for r in res]
        return res

解法4：
二进制法
nums = [1,2,3] 总共有23种组合 正好对应0-7 8个数字
8个数字的二进制形式分别对应一种集合如下图所示

在这里插入图片描述
图来自：[LeetCode] 78. Subsets 子集合
c++：

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res;
        int size = 1 << nums.size();
        for(int i = 0; i < size; i++){
            vector<int> path = convertIntToSet(nums,i);
            res.push_back(path);
        }
        
        return res;
    }
    vector<int> convertIntToSet(vector<int>& nums,int k){
        vector<int> sub;
        int idx = 0;
        for(int i = k; i > 0; i >>= 1){
            if(i & 1 == 1){
                sub.push_back(nums[idx]);
                //cout << nums[idx] << endl;
            }
            idx++;
        }
        return sub;
    }
};

java：

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> res = new ArrayList<>();
        int size = 1 << nums.length;
        for(int i = 0; i < size; i++){
            List<Integer> path = convertIntToSet(nums,i);
            res.add(path);
        }
        
        return res;
    }
    List<Integer> convertIntToSet(int[] nums,int k){
        List<Integer> sub = new ArrayList<>();
        int idx = 0;
        for(int i = k; i > 0; i >>= 1){
            if((i & 1) == 1){
                sub.add(nums[idx]);
            }
            idx++;
        }
        return sub;
    }
}

python：

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        res = []
        #nums.sort()
        for i in xrange(1<<len(nums)):
            tmp = []
            j = 0
            while i > 0:
                
                if i & 1:  
                    tmp.append(nums[j])
                j += 1
                i >>= 1
            res.append(tmp)
           # print res
        return res
dldldl1994
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
LeetCode 刷题记录 90. Subsets II
dldldl1994的博客
11-23 102
题目： Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Example: Input: [1,2,2] ...
LeetCode 刷题记录 7. Reverse Integer
dldldl1994的博客
04-16 4881
Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Output: -321 Example 3: Input: 120 Output: 21 Note: Assume we are dealing with an ...
Leetcode刷题记录 78. 子集
qq_36112576的博客
01-08 118
给定一组不含重复元素的整数数组nums，返回该数组所有可能的子集（幂集）。 说明：解集不能包含重复的子集。 示例: 输入: nums = [1,2,3] 输出: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ] 来源：力扣（LeetCode） 链接：https://leetcode-cn.com/pro...
leetcode刷题记录——78. 子集
虚怀若谷
08-30 104
题目描述：给定一组不含重复元素的整数数组nums，返回该数组所有可能的子集（幂集）。 说明：解集不能包含重复的子集。 错误解法1： public static List<List<Integer>> subsets(int[] nums) { List<List<Integer>> result = new Arra...
谷歌高畅Leetcode刷题笔记.pdf
08-04
谷歌高畅leetcode刷题笔记
LeetCode刷题模板.pdf
04-05
1.4. LeetCode中二分查找题目 29 2. 双指针 30 2.1. 快慢指针 31 2.1.1. 什么是快慢指针 31 2.1.2. 快慢指针模板 31 2.1.3. 快慢指针相关题目 32 2.1.3.1. LC-141:链表是否有环 32 2.1.3.2. LC-142:环形链表入口 34 ...
LeetCode刷题笔记.rar
07-05
LeetCode刷题笔记
9LeetCode刷题题解答案.zip
05-19
9LeetCode刷题题解答案
LeetCode刷题题解答案.pdf
06-27
献给刷题的小伙伴们！一起刷！
LeetCode 刷题记录 8. String to Integer (atoi)
dldldl1994的博客
04-18 428
Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this...
LeetCode 刷题记录 95. Unique Binary Search Trees II
dldldl1994的博客
01-13 249
题目： Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n. Example: Input: 3 Output: [ [1,null,3,2], [3,2,null,1], [3,1,null,null,2], [2,1,3], [1,nul...
LeetCode 刷题记录 50. Pow(x, n)
dldldl1994的博客
10-05 188
题目： Implement pow(x, n), which calculates x raised to the power n (xn). Example 1: Input: 2.00000, 10 Output: 1024.00000 Example 2: Input: 2.10000, 3 Output: 9.26100 Example 3: Input: 2.00000, -2 Outp...
LeetCode 刷题记录 34. Find First and Last Position of Element in Sorted Array
dldldl1994的博客
08-23 171
题目： Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). If t...
LeetCode 刷题记录57. Insert Interval
dldldl1994的博客
10-09 169
题目： Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times. Exa...
LeetCode 刷题记录 40. Combination Sum II
dldldl1994的博客
09-01 159
题目： Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. Each number in candidates ...
LeetCode 刷题记录 5. Longest Palindromic Substring
dldldl1994的博客
04-15 157
题目： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: “babad” Output: “bab” Note: “aba” is also a valid answer. Exam...
LeetCode 刷题记录 9. Palindrome Number
dldldl1994的博客
04-21 154
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: true Example 2: Input: -121 Output: false Explanation...
LeetCode 刷题记录 36. Valid Sudoku
dldldl1994的博客
08-25 152
题目： Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each row must contain the digits 1-9 without repetition. Each column must con...
leetcode刷题手册c++版
最新发布
09-07
LeetCode刷题手册C版是一本针对程序员刷题的教材，旨在帮助他们提高编程能力、学习算法和数据结构。C语言作为一门广泛应用于系统编程和嵌入式开发的语言，在LeetCode刷题中也是非常重要的一种编程语言。 这本手册...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值