(Python, Java) 리트코드 - Subsets

05 Apr 2022 in Algorithm on Leetcode

[문제 링크]

Python 풀이

from typing import List
from itertools import combinations


class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:

        answer =[]
        for size in range(len(nums)+1):
            for comb in combinations(nums,size):
                answer.append(list(comb))

        return answer

Java 풀이

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

class Solution {

    List<List<Integer>> answer = new ArrayList<>();
    int length;

    public List<List<Integer>> subsets(int[] nums) {
        length = nums.length;
        for (int size = 0; size <= length; size++) {
            combination(nums, new LinkedList<>(), size, 0);
        }

        return answer;
    }

    private void combination(int[] nums, LinkedList<Integer> comb, int size, int idx) {
        if (size == 0) {
            answer.add(new ArrayList<>(comb));
            return;
        }

        if (idx >= length)
            return;

        comb.add(nums[idx]);
        combination(nums, comb, size - 1, idx + 1);

        comb.pollLast();
        combination(nums, comb, size, idx + 1);
    }
}