【剑指offer】13、机器人运动的范围

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

        return false;
    }
};