矩阵中的路径（dfs+剪枝、bfs）

class Solution {
    public boolean exist(char[][] board, String word) {
        char[] words = word.toCharArray();
        for(int i=0;i<board.length;i++){
            for(int j=0;j<board[0].length;j++){
                if(dfs(board, words, i, j, 0)) return true;
            }
        }
        return false;
    }
    boolean dfs(char[][] board,char[] words,int i,int j,int k){
        if(i>=board.length || i<0 || j>=board[0].length || j<0 || board[i][j]!=words[k]){
            return false;
        }
        if(k == words.length-1){
            return true;
        }
        board[i][j] = '\0';
        boolean res = dfs(board,words,i+1,j,k+1) || dfs(board,words,i-1,j,k+1) || 
                    dfs(board,words,i,j+1,k+1) || dfs(board,words,i,j-1,k+1);
        board[i][j] = words[k];
        return res;
    }
}

dfs

class Solution {
    public int movingCount(int m, int n, int k) {
        boolean[][] num = new boolean[m][n];
        return dfs(num,m,n,k,0,0);
    }
    int dfs(boolean[][] num ,int m, int n, int k, int i, int j){
        if(i>=m || i<0 || j>=n || j<0 || num[i][j] || sum(i,j)>k){
            return 0;
        }
        num[i][j] = true;
        int res1 = dfs(num,m,n,k,i+1,j);
        int res2 = dfs(num,m,n,k,i-1,j);
        int res3 = dfs(num,m,n,k,i,j+1);
        int res4 = dfs(num,m,n,k,i,j-1);
        return 1+res1+res2+res3+res4;
    }

    int sum(int m,int n){
        int a1 = m/10;
        int a2 = m%10;
        int a3 = n/10;
        int a4 = n%10;
        return a1+a2+a3+a4;
    }
}

bfs

class Solution {
    public int movingCount(int m, int n, int k) {
        boolean[][] visited = new boolean[m][n];
        int res = 0;
        Queue<int[]> queue= new LinkedList<int[]>();
        queue.add(new int[] { 0, 0, 0, 0 });
        while(queue.size() > 0) {
            int[] x = queue.poll();
            int i = x[0], j = x[1], si = x[2], sj = x[3];
            if(i >= m || j >= n || k < si + sj || visited[i][j]) continue;
            visited[i][j] = true;
            res ++;
            queue.add(new int[] { i + 1, j, (i + 1) % 10 != 0 ? si + 1 : si - 8, sj });
            queue.add(new int[] { i, j + 1, si, (j + 1) % 10 != 0 ? sj + 1 : sj - 8 });
        }
        return res;
    }
}