leetcode 2056. 棋盘上有效移动组合的数目

class Solution
{
private:
    vector<vector<int>> RMove= {{1,0},{-1,0},{0,1},{0,-1}};
    vector<vector<int>> BMove= {{1,1},{-1,-1},{-1,1},{1,-1}};
public:
    bool CheckMove(int sx, int sy, int x, int y, int step, vector<vector<vector<char>>>& timeMap)
    {
        if(sx+x*step<0||sx+x*step>=8||sy+y*step<0||sy+y*step>=8)
        {
…    }
    int countCombinations(vector<string>& pieces, vector<vector<int>>& positions)
    {
        vector<vector<vector<char>>> timeMap(7,vector<vector<char>>(8,vector<char>(8,0)));
        return Dfs(0,timeMap,pieces,positions);
    }
};