机器人的活动范围

题目描述

地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动，每一次只能向左，右，上，下四个方向移动一格，但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如，当k为18时，机器人能够进入方格（35,37），因为3+5+3+7 = 18。但是，它不能进入方格（35,38），因为3+5+3+8 = 19。请问该机器人能够达到多少个格子？

牛客网链接：https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

class Solution {
public:
    int movingCount(int threshold, int rows, int cols)
    {
        if (threshold <= 0 || rows <= 0 || cols <= 0)
            return 0;
        bool *visited = new bool[rows * cols];
        memset(visited, 0, rows * cols);
        int count = movingCountCore(threshold, 0, 0, rows, cols, visited);
        delete[] visited;
        return count;
    }
    
    int movingCountCore(int threshold, int row, int col, int rows, int cols, bool* visited)
    {
        int count = 0;
        if (check(threshold, row, col, rows, cols, visited))
        {
            visited[row * cols + col] = true;
            count = 1 + movingCountCore(threshold, row + 1, col, rows, cols, visited) + movingCountCore(threshold, row - 1, col, rows, cols, visited)
                    + movingCountCore(threshold, row, col - 1, rows, cols, visited) + movingCountCore(threshold, row, col + 1, rows, cols, visited);
        }
        return count;
    }
    
    bool check(int threshold, int row, int col, int rows, int cols, bool* visited)
    {
        if (row >= 0 && row < rows && col >= 0 && col < cols && !visited[row * cols + col]
           && (getDigitSum(row) + getDigitSum(col)) <= threshold)
            return true;
        return false;
    }
    
    int getDigitSum(int number)
    {
        int sum = 0;
        while (number > 0)
        {
            sum += number % 10;
            number /= 10;
        }
        return sum;
    }
};