剑指offer第二版第13题：机器人的运动范围(java)

思路：

public class Solution {       //回溯法，好好理解！
    public int movingCount(int threshold, int rows, int cols)
    {
        if(threshold<0||rows<=0||cols<=0)
            return 0;
        boolean[] visited=new boolean[rows*cols];
        int count=0;
        count=movingCountCore(threshold,rows,cols,0,0,visited);
        return count;
    }
    int movingCountCore(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+movingCountCore(threshold,rows,cols,row+1,col,visited)
                   +movingCountCore(threshold,rows,cols,row-1,col,visited)
                   +movingCountCore(threshold,rows,cols,row,col+1,visited)
                   +movingCountCore(threshold,rows,cols,row,col-1,visited);
        }
        return count;
    }
    boolean check(int threshold,int rows,int cols,int row,int col,boolean[] visited){
        if(row>=0 && row<rows && col>=0 && col<cols && getDigitSum(row)+getDigitSum(col)<=threshold  && !visited[row*cols+col])
            return true;
        return false;
    }
    int getDigitSum(int num){
        int sum=0;
        while(num>0){
            sum+=num%10;
            num/=10;
        }
        return sum;
    }
}