【LeetCode】剑指 Offer 13. 机器人的运动范围

【LeetCode】剑指 Offer 13. 机器人的运动范围

package offer;

public class Solution13 {
    public static void main(String[] args) {
        int m = 2;
        int n = 3;
        int k = 1;
        Solution13 solution = new Solution13();
        System.out.println(solution.method(m, n, k));
    }

    int m;                  //行高
    int n;                  //列宽
    boolean[][] visted;     //记录位置是否被访问过

     private int method(int m, int n, int k){
        this.m = m;
        this.n = n;
        visted = new boolean[m][n];
        return dfs(0, 0, k);
    }

    private int dfs(int i, int j, int k){
         if(i >= m || j >= n || sum(i, j) > k || visted[i][j]) return 0;
         visted[i][j] = true;
         //向右下方遍历，每获得一个解就加 1
         return 1 + dfs(i+1, j, k) + dfs(i, j+1, k);
    }

    //计算数位和
    private int sum(int i, int j){
         int sum = 0;
         while(i != 0){
             sum += i % 10;
             i /= 10;
         }
         while(j != 0){
             sum += j % 10;
             j /= 10;
         }
         return sum;
    }
}

//时间复杂度为 O(mn),最差遍历完整个矩阵
//空间复杂度为 O(mn)，最差递归深度为 mn