MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / dfs

Method dfs

java/0130-surrounded-regions.java:27–39  ·  view source on GitHub ↗
(char[][] board, int r, int c)

Source from the content-addressed store, hash-verified

25 }
26
27 private void dfs(char[][] board, int r, int c) {
28 int nRows = board.length;
29 int nCols = board[0].length;
30 if (
31 r < 0 || c < 0 || r >= nRows || c >= nCols || board[r][c] != 'O'
32 ) return;
33
34 board[r][c] = 'T';
35 dfs(board, r + 1, c);
36 dfs(board, r - 1, c);
37 dfs(board, r, c + 1);
38 dfs(board, r, c - 1);
39 }
40}

Callers 1

solveMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected