题目:
地上有一个m行n列的方格。一个机器人从坐标(0,0)的格子开始移动,它每一次可以向左、右、上、下移动一格,但不能进入行坐标和列坐标的数位(个位、十位等)之和大于K的格子。请问该机器人能够到达多少个格子?
思路:
参考:面试题73:矩阵中的路径
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm> //堆算法
#include <functional> //仿函数
using namespace std;
int GetDigitSum(int num)
{
int sum = 0;
while (num > 0)
{
sum += num % 10;
num /= 10;
}
return sum;
}
bool Check(int K, int row, int column, int rIndex, int cIndex, vector<vector<bool>>&visited)
{
if (rIndex >= 0 && rIndex <= row && cIndex >= 0 && cIndex <= column && GetDigitSum(rIndex) + GetDigitSum(cIndex) <= K && !visited[rIndex][cIndex])
return true;
return false;
}
int MovingCountCore(int K, int row, int column, int rIndex, int cIndex, vector<vector<bool>>&visited)
{
int count = 0;
if (Check(K,row,column,rIndex,cIndex,visited))
{
visited[rIndex][cIndex] = 1;
count = 1 + MovingCountCore(K, row, column, rIndex + 1, cIndex, visited) +//下
MovingCountCore(K, row, column, rIndex - 1, cIndex, visited) + //上
MovingCountCore(K, row, column, rIndex, cIndex + 1, visited) + //右
MovingCountCore(K, row, column, rIndex, cIndex - 1, visited); //左
}
return count;
}
int MovingCount(int K, int row, int column)
{
vector<vector<bool>> visited(row + 1, vector<bool>(column + 1, 0));
int count = MovingCountCore(K, row, column, 0, 0, visited);
return count;
}
int main()
{
cout << MovingCount(4, 3, 4) << endl;
return 0;
}