实现程序,有一个rows*colunms的矩阵,机器人从(0,0)出发,每次只能向上下左右走一格,但不能进入行坐标和列坐标的位数之和大于k的格子,那么机器人能去的格子有多少个?
测试用例:
功能测试:方格为多行多列,k为整数
边界值测试:方格只有一行或一列,k等于0
特殊输入测试:k为负数
#include<iostream>
#include<string.h>
using namespace std;
int getSum(int n)
{
int sum=0;
while(n>0)
{
sum+=n%10;
n/=10;
}
return sum;
}
bool check(int k,int rows,int colunms,int row,int colunm,bool *visited)
{
if(row>=0&&colunm>=0&&row<rows&&colunm<colunms&&visited[row*rows+colunm]==0&&getSum(row)+getSum(colunm)<k)
return true;
return false;
}
int movingCountCore(int k,int rows,int colunms,int row,int colunm,bool *visited)
{
int Count=0;
if(check(k,rows,colunms,row,colunm,visited))
{
visited[row*rows+colunm]=1;
Count=1+movingCountCore(k,rows,colunms,row-1,colunm,visited)
+movingCountCore(k,rows,colunms,row,colunm-1,visited)
+movingCountCore(k,rows,colunms,row+1,colunm,visited)
+movingCountCore(k,rows,colunms,row,colunm+1,visited);
}
return Count;
}
int movingCount(int k,int rows,int colunms)
{
if(k<0||rows<1||colunms<1)
return 0;
bool *visited=new bool[rows*colunms];
memset(visited,0,rows*colunms);
int Count=movingCountCore(k,rows,colunms,0,0,visited);
delete []visited;
return Count;
}
int main()
{
cout<<movingCount(2,4,4)<<endl;
}