{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2021-04-01--002","result":{"data":{"site":{"siteMetadata":{"title":"Blog by Eunyoung","subtitle":"작업 기록 블로그","copyright":"© All rights reserved.","author":{"name":"EunYoung","twitter":"#"},"disqusShortname":"","url":"https://ssongey.github.io"}},"markdownRemark":{"id":"0acd98b5-e4d8-5a49-8b21-c97e45f7329f","html":"

#. 테스트 문제

\n

\n \n \n \n \n \n \n \n \n \n

\n
\n

#. 결과 및 풀이

\n

1. 풀이

\n
@Test\nvoid subsets_부분집합() {\n    int[][] result = subsets(new int[]{1, 2, 3});\n    int[][] expected = {{}, {1}, {1,2}, {1,2,3}, {1,3}, {2}, {2,3}, {3}};\n    \n    for (int i = 0; i < expected.length; i++) {\n        Assertions.assertArrayEquals(expected[i], result[i]);\n    }\n\n}\n\nint[][] subsets(int[] nums) {\n    List<List<Integer>> result = new ArrayList<>();\n    List<Integer> list = new ArrayList<>();\n    if(nums == null || nums.length == 0) {\n        return result.stream().map(r -> r.stream().mapToInt(i -> i).toArray()).toArray(int[][]::new);\n    }\n    subsetsDfs(result, list, nums, 0);\n    \n    return result.stream().map(r -> r.stream().mapToInt(i -> i).toArray()).toArray(int[][]::new);\n}\n\nprivate void subsetsDfs(List<List<Integer>> lists, List<Integer> cur, int[] nums, int start) {\n    //1.\n    List<Integer> list = new ArrayList<>(cur);\n    lists.add(list);\n    \n    //2.\n    for (int i=start; i<nums.length; i++) {\n        cur.add(nums[i]);\n        subsetsDfs(lists, cur, nums, i + 1);\n        cur.remove(cur.size() - 1);\n    }\n}
\n
\n

배웠다

\n","fields":{"tagSlugs":["/tags/back-tracking/"],"slug":"/algo/posts/2021-04-01--002"},"frontmatter":{"title":"[참고] Subsets - 부분집합","tags":["back-tracking"],"date":"2021-04-01","description":"백트랙킹"}}},"pageContext":{"slug":"/algo/posts/2021-04-01--002"}},"staticQueryHashes":[]}