leetcode中等剑指13机器人的运动范围

Posted 2021-11-02 qq_40707462

思路：dfs
走到一个格子，用visited数组记录是否来过，判断是否“合格”，然后向上下左右走

class Solution {
    public int movingCount(int m, int n, int k) {
        boolean visited[][]=new boolean[m][n];
        return dfs(0, 0, m, n, k, visited);
    }
    public int dfs(int i,int j,int m,int n,int k,boolean[][]visited){
        if(i<0 || i>=m || j<0 || j>=n || 
        (i/10 + i%10 + j/10 + j%10) > k || visited[i][j]){
            return 0;
        }
        visited[i][j]=true;
        return dfs(i + 1, j, m, n, k, visited) + dfs(i - 1, j, m, n, k, visited) + 
               dfs(i, j + 1, m, n, k, visited) + dfs(i, j - 1, m, n, k, visited) + 1;
    }
}