zoukankan      html  css  js  c++  java
  • 90. Subsets II(js)

    90. Subsets II

    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]
    Output:
    [
      [2],
      [1],
      [1,2,2],
      [2,2],
      [1,2],
      []
    ]
    题意:求数组所有不重复子数组
    代码如下:
    /**
     * @param {number[]} nums
     * @return {number[][]}
     */
    //回溯
    var subsetsWithDup = function(nums) {
            nums.sort((a,b)=>a-b);
            let res=[];
            let cur=[]
            backtrack(res,cur,0,nums);
            return res;
        }
    var backtrack =function(res,curr,index,nums){
            res.push(curr);
            for(let i=index;i<nums.length;i++){
                if(i>index && nums[i-1]==nums[i]) continue;
                backtrack(res,[...curr,nums[i]],i+1,nums);
            }
        }
  • 相关阅读:
    CF235D
    模拟赛 circle 题解
    平面图总结
    kd 树总结
    思维题
    luogu P1600 天天爱跑步
    UOJ #42. 【清华集训2014】Sum
    FZOJ 4344 连通性
    平衡树
    计蒜客 T3225 Darko 的生成树
  • 原文地址:https://www.cnblogs.com/xingguozhiming/p/10707089.html
Copyright © 2011-2022 走看看