{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2021-04-01--003","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":"83093f93-9435-5e7c-8584-19d0050f8994","html":"

#. 테스트 문제

\n

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

\n
\n

#. 결과 및 풀이

\n

1. 풀이

\n
@Test\nvoid permutation_순열() {\n    int[][] result = permutation_solution(new int[]{1, 2, 3});\n    int[][] expected = { {1,2,3}, {1,3,2}, {2,1,3}, {2,3,1}, {3,1,2}, {3,2,1} };\n    for (int i = 0; i < expected.length; i++) {\n        Assertions.assertArrayEquals(expected[i], result[i]);\n    }\n}\n\nint[][] permutation_solution(int[] nums) {\n\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    permutation_dfs(nums, result, list);\n    \n    return result.stream().map(r -> r.stream().mapToInt(i -> i).toArray()).toArray(int[][]::new);\n}\n\nvoid permutation_dfs(int[] nums, List<List<Integer>> lists, List<Integer> cur) {\n    //담기\n    if(cur.size() == nums.length) {\n        List<Integer> list = new ArrayList<>(cur);\n        lists.add(list);\n    }\n\n    //저장, 탈출\n    for (int num : nums) {\n        if (cur.contains(num))\n            continue;\n        cur.add(num);\n        permutation_dfs(nums, lists, cur);\n        cur.remove(cur.size() - 1);\n    }\n}
\n
\n

배웠다

","fields":{"tagSlugs":["/tags/back-tracking/"],"slug":"/algo/posts/2021-04-01--003"},"frontmatter":{"title":"[참고] Permutation - 순열","tags":["back-tracking"],"date":"2021-04-01","description":"백트랙킹"}}},"pageContext":{"slug":"/algo/posts/2021-04-01--003"}},"staticQueryHashes":[]}