LeetCode 90 --- Subsets II

2019-11-08 01:04:24

字体：大中小

来源：转载

供稿：网友

题目链接： LeetCode 90 — Subsets II

AC代码：

public class PRoblem90 { public static void main(String[] args) { // TODO Auto-generated method stub } public List<List<Integer>> subsetsWithDup(int[] nums) { List<List<Integer>> list=new ArrayList<List<Integer>>(); List<Integer> go =new ArrayList<Integer>(); list.add(new ArrayList<Integer>(go)); Arrays.sort(nums); fillElement(nums, list, go, 0); return list; } public void fillElement(int[]nums,List<List<Integer>> list,List<Integer> go,int start){ for(int i=start;i<nums.length;i++){ if(i!=start && nums[i-1]==nums[i])continue; go.add(nums[i]); fillElement(nums, list, go, i+1); list.add(new ArrayList<Integer>(go)); go.remove(go.size()-1); } }}

上一篇：小鑫的城堡

下一篇：算法提高身份证号码升级