Java怎么解决机器人走格子问题

//计算数字位数之和int getDigitSum(int number){
    int sum=0;//临时变量,保存一个数字数位和        while(number){                sum+=number;        number/=10;    }    
    return sum;
}

//机器人能否进入某个格子，即从三个方面考虑：//①是否越界，②数位之和是否满足条件，③邻域格子是否已经访问过bool check（int threshold,int rows,int cols,int row,int col,bool* visit）{
    if(row>=0&&col>=0&&row        &&!visit[row*cols+col])        return true;    return false;
}

int movingCountCore(int threshold,int rows,int cols, int row,int col, bool *visited){
    int count=0;    if(check(threshold,rows,cols,row,col,bool* 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;
}

int movingCount(int threshold,int rows,int cols){    //要考虑负值的情况    if(threshold<0||rows<=0||cols<=0)        {return 0;}        bool* visited=new bool[rows*cols];    for(int i=0;i<=rows*cols;++i){        visited=false;    }    int count=movingCountCore(threshold,rows,cols,0,0,visited);    delete[] visited;    return count;}