[自我记录]随想录刷题第二十六天 | 332. 重新安排行程, 51. N皇后, 37. 解数独

代码随想录算法打卡第二十六天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

---

332. 重新安排行程

class Solution {
public:
    vector<string> findItinerary(vector<vector<string>>& tickets) {
        targets.clear();
        result.clear();
        for (const auto& ticket: tickets) {
            targets[ticket[0]][ticket[1]]++;
        }
        result.push_back("JFK");
        backtracking(tickets.size());
        return result;
    }
private:
    vector<string> result;
    unordered_map<string, map<string, int>> targets;
    bool backtracking(int ticketNum) {
        if (result.size() == ticketNum + 1) {
            return true;
        }
        for (auto& target: targets[result[result.size() - 1]]) {
            if (target.second > 0) {
                target.second--;
                result.push_back(target.first);
                if (backtracking(ticketNum)) return true;
                target.second++;
                result.pop_back();
            }
        }
        return false;
    }
};

---

51. N皇后

class Solution {
public:
    vector<vector<string>> solveNQueens(int n) {

        chessboard.clear();
        result.clear();
        string tmp(n, '.');
        chessboard = vector<string>(n, tmp);
        backtracking(n, 0);
        return result;
    }
private:
    vector<string> chessboard;
    vector<vector<string>> result;
    
    void backtracking(int n, int row) {
        if (row == n) {
            	result.push_back(chessboard);
            return;
        }
        for (int i = 0; i < n; ++i) {
            if (isValid(row, i, chessboard, n)) {
            	chessboard[row][i] = 'Q';
            	backtracking(n, row + 1);
            	chessboard[row][i] = '.';
        }
	}
}
    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;
    }
};

---

37. 解数独

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

---

大病一场, 希望能再坚持下去