{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2021-04-01--006","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":"838b7505-3415-517f-bbc7-5e765abb749e","html":"

#. 테스트 문제

\n

\n
\n

#. 결과 및 풀이

\n

1. 풀이

\n
@Test\nvoid NumberOfIsland_DFS() {\n    char[][] grid = {{'1', '1', '1', '0', '1'}, {'1', '1', '0', '0', '0'}, {'1', '1', '0', '0', '1'}, {'0', '0', '0', '0', '1'}};\n    Assertions.assertEquals(3, NumberOfIsland_DFS_Solution(grid));\n}\n\nprivate int NumberOfIsland_DFS_Solution(char[][] grid) {\n\n    if(grid == null || grid.length == 0 || grid[0].length == 0) return 0;\n    \n    int count = 0;\n    for(int i=0; i<grid.length; i++) {\n        for(int j=0; j<grid[i].length; j++) {\n            if(grid[i][j] == '1') {\n                count++;\n                NumberOfIsland_DFS(grid, i, j);\n            }\n        }\n    }\n    return count;\n}\n\nprivate void NumberOfIsland_DFS(char[][] grid, int i, int j) {\n    int m = grid.length;\n    int n = grid[0].length;\n    \n    if(i < 0 || i >= m || j < 0 || j >= n || grid[i][j] != '1')\n        return;\n    \n    grid[i][j] = 'x';\n    \n    NumberOfIsland_DFS(grid, i-1, j);\n    NumberOfIsland_DFS(grid, i+1, j);\n    NumberOfIsland_DFS(grid, i, j-1);\n    NumberOfIsland_DFS(grid, i, j+1);\n}
\n
\n

배웠다

","fields":{"tagSlugs":["/tags/dfs/"],"slug":"/algo/posts/2021-04-01--006"},"frontmatter":{"title":"[참고] Number Of Island - DFS","tags":["DFS"],"date":"2021-04-01","description":"섬의 개수"}}},"pageContext":{"slug":"/algo/posts/2021-04-01--006"}},"staticQueryHashes":[]}