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

第一题、回溯算法总结

第二题、重新安排行程  力扣题目链接

class Solution {
private:
    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;
    }
public:
    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;
    }
};

第三题、N皇后问题 力扣题目链接

class Solution {
private:
    vector<vector<string>> result;
    void backtracking(int n, int row, vector<string>& chessboard){
        if(row == n){
            result.push_back(chessboard);
            return;
        }
        for(int col=0; col < n; col++){
            if(isValid(row, col, chessboard, n)){
                chessboard[row][col] = 'Q';
                backtracking(n, row+1, chessboard);
                chessboard[row][col] = '.';
            }
        }
    }
    // 判断可不可以放置的逻辑
    // 搜索是按行的，判断就判断列、45度角线上、135度角线上的
    bool isValid(int row, int col, vector<string>& chessboard, int n){ 
        for(int i=0; i < row; i++){
            if(chessboard[i][col] == 'Q') return false;
        }
        for(int i = row-1, j = col-1; i >= 0 && j >= 0; i--, j--){
            if(chessboard[i][j] == 'Q') return false;
        }
        for(int i = row-1, j = col+1; i >= 0 && j < n; i--, j++){
            if(chessboard[i][j] == 'Q') return false;
        }
        return true;
    }
public:
    vector<vector<string>> solveNQueens(int n) {
        result.clear();
        std::vector<std::string> chessboard(n, std::string(n, '.'));
        backtracking(n, 0, chessboard);
        return result;
    }
};

第四题、解数独  力扣题目链接

class Solution {
private:
    bool backtracking(vector<vector<char>>& board){
        for(int i=0; i < board.size(); i++){  // 行
            for(int j=0; j < board[i].size(); j++){  // 列
                if(board[i][j] == '.'){  // 待填写数字
                    for(char k = '1'; k <= '9'; k++){  // 1到9挨着试
                        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 row, int col, char val, vector<vector<char>>& board){
        for(int i = 0; i < 9; i++){
            if(board[i][col] == val){
                return false;
            }
        }
        for(int j = 0; j < 9; j++){
            if(board[row][j] == val){
                return false;
            }
        }
        int startRow = (row / 3) * 3;
        int startCol = (col / 3) * 3;
        for(int i = startRow; i < startRow + 3; i++){
            for(int j = startCol; j < startCol + 3; j++){
                if(board[i][j] == val){
                    return false;
                } 
            }
        }
        return true;
    }
public:
    void solveSudoku(vector<vector<char>>& board) {
        backtracking(board);
    }
};