@@ -0,0 +1,920 @@
+public class Solution %7B%0A    public boolean exist(char%5B%5D%5B%5D board, String word) %7B%0A        for (int i = 0; i %3C board.length; i++) %7B%0A            for (int j = 0; j %3C board%5Bi%5D.length; j++) %7B%0A                if(exist(board, i, j, word, 0)) return true;%0A            %7D%0A        %7D%0A        return false;%0A    %7D%0A    %0A    private boolean exist(char%5B%5D%5B%5D board, int x, int y, String word, int start) %7B%0A        if(start %3E= word.length()) return true;%0A        if(x %3C 0 %7C%7C x %3E= board.length %7C%7C y %3C 0 %7C%7C y %3E= board%5B0%5D.length) return false;%0A        if (board%5Bx%5D%5By%5D == word.charAt(start++)) %7B%0A            char c = board%5Bx%5D%5By%5D;%0A            board%5Bx%5D%5By%5D = '#';%0A            boolean res = exist(board, x + 1, y, word, start) %7C%7C exist(board, x - 1, y, word, start) %7C%7C%0A            exist(board, x, y + 1, word, start) %7C%7C exist(board, x, y - 1, word, start);%0A            board%5Bx%5D%5By%5D = c;%0A            return res;%0A        %7D%0A        return false;%0A    %7D%0A%7D%0A

Create 066_StringPathInMatrix.java