JAVA_LeetCode 79_Word Search

JAVA_LeetCode 79_Word Search 풀이 class Solution { public boolean exist(char[][] board, String word) { // dfs, 백트래킹 사용 int rows = board.length, cols = board[0].length; char[] arr = word.toCharArray(); for(int i = 0; i < rows; i++) { for(int j = 0; j < cols; j++) { if(dfs(board, arr, 0, i, j)) return true; } } return false; } public boolean dfs(char[][] board, char[] word, int idx, int row, int col) { // 경계 벗어나거나 단어가 불일치한경우 if(row < 0 || col < 0 || row >= board.length || col >= board[0].length || b...