代码随想录D30

332.重新安排行程（可跳过） 

代码随想录

class Solution {
private:
    vector<string> result;
    vector<string> set;
    vector<bool> used;
public:
    vector<string> findItinerary(vector<vector<string>>& tickets) {
        sort(tickets.begin(), tickets.end());
        set.push_back("JFK");
        used.resize(tickets.size());
        for(bool b : used){
            b = false;
        }
        backtracking(tickets);

        return result;
    }

    bool backtracking(vector<vector<string>>& tickets){
        if(set.size() == tickets.size() + 1){
            for(string str : set){
                result.push_back(str);
            }
            return true;
        }
        string back = set.back();

        for(int i = 0; i < tickets.size(); i++){
            if(used[i] == true || tickets[i][0] != back){
                continue;
            }

            used[i] = true;
            set.push_back(tickets[i][1]);
            if(backtracking(tickets)) return true;
            set.pop_back();
            used[i] = false;
        }
        return false;
    }
};

51. N皇后（可跳过） 

代码随想录

视频讲解：这就是传说中的N皇后？ 回溯算法安排！| LeetCode：51.N皇后_哔哩哔哩_bilibili

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] = '.'; 
        }
    }
}
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();
        vector<string> chessboard(n, string(n, '.'));
        backtracking(n, 0, chessboard);
        return result;
    }
};

37. 解数独（可跳过） 

代码随想录

视频讲解：回溯算法二维递归？解数独不过如此！| LeetCode：37. 解数独_哔哩哔哩_bilibili

class Solution {
private:
bool backtracking(vector<vector<char>>& board) {
    for (int i = 0; i < board.size(); i++) {        
        for (int j = 0; j < board.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 row, int col, char val, vector<vector<char>>& board) {
    for (int i = 0; i < 9; i++) {
        if (board[row][i] == val) {
            return false;
        }
    }
    for (int j = 0; j < 9; j++) {
        if (board[j][col] == 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);
    }
};