代码随想录算法训练营第三十天 回溯

332. 重新安排行程

没有怎么看懂这个题目，题解·有些茫然，感觉还是得之后再来继续思考

class Solution {
public:
    unordered_map<string, map<string, int>> targets;
    bool backtracking(int ticketNum, vector<string>& result) {
        if (result.size() == ticketNum + 1) {
            return true;
        }

        for (pair<const string, int>& target : targets[result[result.size() - 1]]) {
            if (target.second > 0) {
                result.push_back(target.first);
                target.second--;
                if (backtracking(ticketNum, result)) return true;
                result.pop_back();
                target.second++;
            }
        }
        return false;
    }
    vector<string> findItinerary(vector<vector<string>>& tickets) {
        targets.clear();
        vector<string> result;
        for (const vector<string>& vec : tickets) {
            targets[vec[0]][vec[1]]++;
        }
        result.push_back("JFK");
        backtracking(tickets.size(), result);
        return result;
    }
};

以及一些稍微复杂一些的数据结构的使用自己还是太不熟练了

51. N 皇后

class Solution {
public:
    vector<vector<string>> result;
    void backtracking(vector<string>& cheerboard, int n, int row) {
        if (row == n) {
            result.push_back(cheerboard);
            return;
        }
        for (int col = 0; col < n; ++col) {
            if (isValid(cheerboard, col, row, n)) {
                cheerboard[row][col] = 'Q';
                backtracking(cheerboard, n, row + 1);
                cheerboard[row][col] = '.';
            }
        }
    }
    bool isValid(vector<string>& cheerboard, int col, int row, int n) {
        for (int i = 0; i < n; ++i) {
            if (i != row && cheerboard[i][col] == 'Q') {
                return false;
            }
        }
        for (int j = 0; j < n; ++j) {
            if (j != col && cheerboard[row][j] == 'Q') {
                return false;
            }
        }
        for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; --i, --j) {
            if (cheerboard[i][j] == 'Q') {
                return false;
            }
        }
        for (int i = row - 1, j = col + 1; i >= 0 && j < n; --i, ++j) {
            if (cheerboard[i][j] == 'Q') {
                return false;
            }
        }
        return true;
    }
    vector<vector<string>> solveNQueens(int n) {
        vector<string> cheerboard(n, string(n, '.'));
        backtracking(cheerboard, n, 0);
        return result;
    }
};

N皇后问题倒是不难，自己之前在回溯法中学习到过，说到底回溯法不过就是遍历罢了

37. 解数独

class Solution {
public:
    bool backtracking(vector<vector<char>>& board) {
        for (int i = 0; i < board.size(); ++i) {
            for (int j = 0; j < board[0].size(); ++j) {
                if (board[i][j] == '.') {
                    for (char k = '1'; k <= '9'; ++k) {
                        if (isValid(i, j, k, board)) {
                            board[i][j] = k;
                            if (backtracking(board)) return true;
                            board[i][j] = '.';
                        }
                    }
                    return false;
                }
            }
        }
        return true;
    }
    bool isValid(int i, int j, char k, vector<vector<char>>& board) {
        for (int row = 0; row < board.size(); ++row) {
            if (board[row][j] == k) {
                return false;
            }
        }
        for (int col = 0; col < board[0].size(); ++col) {
            if (board[i][col] == k) {
                return false;
            }
        }
        int rowLen = (i / 3) * 3, colLen = (j / 3) * 3;
        for (int row = rowLen; row < rowLen + 3; row++) {
            for (int col = colLen; col < colLen + 3; col++) {
                if (board[row][col] == k) {
                    return false;
                }
            }
        }
        return true;
    }
    void solveSudoku(vector<vector<char>>& board) {
        backtracking(board);
    }
};