剑指offer 面试题13 机器人的运动范围

解题思路：回溯法

 public static void main(String[] args) {
        int num = getNum(12);
        System.out.println(num);
        int rows=10;
        int cols=10;
        int threshold=5;
        int i = movingCount(threshold, rows, cols);
        System.out.println(i);

    }
    public static int movingCount(int threshold, int rows, int cols) {
        boolean[] visited=new boolean[rows*cols];
        for(int i=0;i<visited.length;i++){
            visited[i]=false;
        }
        int i = movingCount(threshold, rows, cols, 0, 0, visited);
        return i;
    }
    public static int  movingCount(int threshold, int rows,int cols,int row,int col,boolean[] visited){
        int count=0;
        if(check(threshold, rows,cols,row,col,visited)){
            visited[row*cols+col]=true;
            count=1+movingCount(threshold,rows,cols,row-1,col,visited)+
                    movingCount(threshold,rows,cols,row+1,col,visited)+
                    movingCount(threshold,rows,cols,row,col-1,visited)+
                    movingCount(threshold,rows,cols,row,col+1,visited);
            return count;
        }else{
            return 0;
        }
    }
    public static boolean check(int threshold, int rows,int cols,int row,int col,boolean[] visited){
        if(row>=0 && row<rows && col>=0 && col<cols && getNum(row)+getNum(col)<=threshold && !visited[row*cols+col]){
            return true;
        }
        return false;
    }

    public static int getNum(int num){
        int sum=0;
        while(num>0){
            sum+=num%10;
            num=num/10;
        }
        return sum;
    }