class Solution {
public:
int movingCount(int threshold, int rows, int cols)
{
if(threshold<1||rows<1||cols<1)
return 0;
bool* visited = new bool[rows*cols];
for(int i=0;i<rows*cols;++i){
visited[i]=false;
}
int ans = movingnode(threshold,rows,cols,visited,0,0);
delete[] visited;
return ans;
}
int movingnode(int threshold,int rows,int cols,bool* visited,int i,int j){
int count = 0;
if(getsum(i,j,rows,cols,threshold,visited)){
visited[i*cols+j]=true;
count = 1+movingnode(threshold,rows,cols,visited,i,j-1)+movingnode(threshold,rows,cols,visited,i,j+1)+movingnode(threshold,rows,cols,visited,i-1,j)+movingnode(threshold,rows,cols,visited,i+1,j);
}
return count;
}
private:
bool getsum(int row1,int col1,int rows,int cols,int threshold,bool* visited){
if(row1>=0&&row1<rows&&col1>=0&&col1<cols&&!visited[row1*cols+col1]&&getsingle(row1)+getsingle(col1)<=threshold)
return true;
return false;
}
int getsingle(int index){
int temp = 0;
while(index>0){
temp += index%10;
index /= 10;
}
return temp;
}
};
public:
int movingCount(int threshold, int rows, int cols)
{
if(threshold<1||rows<1||cols<1)
return 0;
bool* visited = new bool[rows*cols];
for(int i=0;i<rows*cols;++i){
visited[i]=false;
}
int ans = movingnode(threshold,rows,cols,visited,0,0);
delete[] visited;
return ans;
}
int movingnode(int threshold,int rows,int cols,bool* visited,int i,int j){
int count = 0;
if(getsum(i,j,rows,cols,threshold,visited)){
visited[i*cols+j]=true;
count = 1+movingnode(threshold,rows,cols,visited,i,j-1)+movingnode(threshold,rows,cols,visited,i,j+1)+movingnode(threshold,rows,cols,visited,i-1,j)+movingnode(threshold,rows,cols,visited,i+1,j);
}
return count;
}
private:
bool getsum(int row1,int col1,int rows,int cols,int threshold,bool* visited){
if(row1>=0&&row1<rows&&col1>=0&&col1<cols&&!visited[row1*cols+col1]&&getsingle(row1)+getsingle(col1)<=threshold)
return true;
return false;
}
int getsingle(int index){
int temp = 0;
while(index>0){
temp += index%10;
index /= 10;
}
return temp;
}
};