@@ -0,0 +1,1296 @@
+class Solution %7B%0A    public boolean exist(char%5B%5D%5B%5D board, String word) %7B%0A        boolean%5B%5D%5B%5D visited = new boolean%5Bboard.length%5D%5Bboard%5B0%5D.length%5D;%0A        char%5B%5D arr = word.toCharArray();%0A%0A        for(int i = 0; i %3C board.length; i++) %7B%0A            for (int j = 0; j %3C board%5B0%5D.length; j++) %7B%0A                if (check(board, visited, arr, i, j, 0)) %7B%0A                    return true;%0A                %7D%0A            %7D%0A        %7D%0A        return false;%0A    %7D%0A%0A    private boolean check(char%5B%5D%5B%5D board, boolean%5B%5D%5B%5D visited, char%5B%5D word, int i, int j, int k) %7B%0A        if (k %3E word.length - 1) %7B%0A            return true;%0A        %7D%0A        if (i %3E board.length - 1 %7C%7C i %3C 0 %7C%7C j %3E board%5B0%5D.length - 1 %7C%7C j %3C 0) %7B%0A            return false;%0A        %7D%0A        if (visited%5Bi%5D%5Bj%5D %7C%7C board%5Bi%5D%5Bj%5D != word%5Bk%5D) %7B%0A            return false;%0A        %7D%0A        visited%5Bi%5D%5Bj%5D = true;%0A        if (check(board, visited, word, i+1, j, k+1)) %7B%0A            return true;%0A        %7D%0A        if (check(board, visited, word, i, j+1, k+1)) %7B%0A            return true;%0A        %7D%0A        if (check(board, visited, word, i-1, j, k+1)) %7B%0A            return true;%0A        %7D%0A        if (check(board, visited, word, i, j-1, k+1)) %7B%0A            return true;%0A        %7D      %0A        visited%5Bi%5D%5Bj%5D = false;%0A        return false;  %0A    %7D%0A%7D%0A

Create WordExist.java