java 力扣 78题 子集

 

class Solution {

    public List<List<Integer>> subsets(int[] nums) {

        List<List<Integer>> rs=new ArrayList<>();

        rs.add(new ArrayList<>());

        for (int i = 0; i < nums.length; i++) {

            List<Integer> list=new ArrayList<>();

            list.add(nums[i]);

            rs.add(list);

            if (nums.length>=i+1) {

                for (int j = i+1; j < nums.length; j++) {

                    List<Integer> list1=new ArrayList<>();

                    list1.add(nums[i]);

                    list1.add(nums[j]);

                    rs.add(list1);

                    if (nums.length>=j+1){

                        for (int k = j+1; k < nums.length; k++) {

                            List<Integer> list2=new ArrayList<>();

                            list2.add(nums[i]);

                            list2.add(nums[j]);

                            list2.add(nums[k]);

                            rs.add(list2);

                            if (nums.length>=k+1){

                                for (int l = k+1; l < nums.length; l++) {

                                    List<Integer> list3=new ArrayList<>();

                                    list3.add(nums[i]);

                                    list3.add(nums[j]);

                                    list3.add(nums[k]);

                                    list3.add(nums[l]);

                                    rs.add(list3);

                                    if (nums.length>=l+1){

                                        for (int m = l+1; m < nums.length; m++) {

                                            List<Integer> list4=new ArrayList<>();

                                            list4.add(nums[i]);

                                            list4.add(nums[j]);

                                            list4.add(nums[k]);

                                            list4.add(nums[l]);

                                            list4.add(nums[m]);

                                            rs.add(list4);

                                            if (nums.length>=m+1){

                                                for (int n = m+1; n < nums.length; n++) {

                                                    List<Integer> list5=new ArrayList<>();

                                                    list5.add(nums[i]);

                                                    list5.add(nums[j]);

                                                    list5.add(nums[k]);

                                                    list5.add(nums[l]);

                                                    list5.add(nums[m]);

                                                    list5.add(nums[n]);

                                                    rs.add(list5);

                                                    if (nums.length>=n+1){

                                                        for (int b = n+1; b < nums.length; b++) {

                                                            List<Integer> list6=new ArrayList<>();

                                                            list6.add(nums[i]);

                                                            list6.add(nums[j]);

                                                            list6.add(nums[k]);

                                                            list6.add(nums[l]);

                                                            list6.add(nums[m]);

                                                            list6.add(nums[n]);

                                                            list6.add(nums[b]);

                                                            rs.add(list6);

                                                            if (nums.length>=b+1){

                                                                for (int v = b+1; v < nums.length; v++) {

                                                                    List<Integer> list7=new ArrayList<>();

                                                                    list7.add(nums[i]);

                                                                    list7.add(nums[j]);

                                                                    list7.add(nums[k]);

                                                                    list7.add(nums[l]);

                                                                    list7.add(nums[m]);

                                                                    list7.add(nums[n]);

                                                                    list7.add(nums[b]);

                                                                    list7.add(nums[v]);

                                                                    rs.add(list7);

                                                                    if (nums.length>=v+1){

                                                                        for (int c = v+1; c < nums.length; c++) {

                                                                            List<Integer> list8=new ArrayList<>();

                                                                            list8.add(nums[i]);

                                                                            list8.add(nums[j]);

                                                                            list8.add(nums[k]);

                                                                            list8.add(nums[l]);

                                                                            list8.add(nums[m]);

                                                                            list8.add(nums[n]);

                                                                            list8.add(nums[b]);

                                                                            list8.add(nums[v]);

                                                                            list8.add(nums[c]);

                                                                            rs.add(list8);

                                                                            if (nums.length>=v+1){

                                                                                for (int x = c+1; x < nums.length; x++) {

                                                                                    List<Integer> list9=new ArrayList<>();

                                                                                    list9.add(nums[i]);

                                                                                    list9.add(nums[j]);

                                                                                    list9.add(nums[k]);

                                                                                    list9.add(nums[l]);

                                                                                    list9.add(nums[m]);

                                                                                    list9.add(nums[n]);

                                                                                    list9.add(nums[b]);

                                                                                    list9.add(nums[v]);

                                                                                    list9.add(nums[c]);

                                                                                    list9.add(nums[x]);

                                                                                    rs.add(list9);

                                }}}}}}}}}}}}}

                            }

                        }

                    }

            }

            }

        }

        return rs;

    }

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值