day30｜● 332.重新安排行程 ● 51. N皇后 ● 37. 解数独 ● 总结

最新推荐文章于 2024-06-13 08:37:22 发布

EssieDing

最新推荐文章于 2024-06-13 08:37:22 发布

阅读量18

点赞数

文章标签： java 数学建模算法

本文链接：https://blog.csdn.net/Dorothy603/article/details/131376685

版权

332.重新安排行程

class Solution {
    List<String> result = new ArrayList<>();
    Map<String, Map<String, Integer>> targets = new HashMap<>();
    public List<String> findItinerary(List<List<String>> tickets) {
        for (List<String> ticket: tickets) {
            String from = ticket.get(0);
            String to = ticket.get(1);
            Map<String, Integer> values;
            if (targets.containsKey(from)) {
                values = targets.get(from);
            } else {
                values = new TreeMap<>();
            }
            values.put(to, values.getOrDefault(to, 0) +1);
            targets.put(from, values);
        }
        result.add("JFK");
        backtracking(tickets);
        return result;
    }
    private boolean backtracking(List<List<String>> tickets){
        if (result.size() == tickets.size()+1){
            return true;
        }
        if (targets.containsKey(result.get(result.size()-1))){
            for(Map.Entry<String, Integer> target : targets.get(result.get(result.size()-1)).entrySet()){
                String to = target.getKey();
                int times = target.getValue();
                if (times > 0) {
                    result.add(to);
                    target.setValue(times-1);
                    if (backtracking(tickets)) {
                        return true;
                    }
                    result.remove(result.size()-1);
                    target.setValue(times);
                }
            }
        }
        return false;
    }
}

51. N皇后

class Solution {
    List<String> path = new ArrayList<>();
    List<List<String>> result = new ArrayList<>();
    public List<List<String>> solveNQueens(int n) {
        backtracking(n, 0);
        return result;
    }
    private void backtracking(int n, int row){
        if (row == n) {
            result.add(new ArrayList<>(path));
            return;
        }
        for (int i = 0; i < n; i++) {
            if (!isValid(row, i, n)) {
                continue;
            }
            path.add(constructString(n, i));
            backtracking(n, row+1);
            path.remove(path.size()-1);
        }
    }

    private boolean isValid(int row, int col, int n) {
        for (int i = 0; i < row; i++) { // check col
            if (path.get(i).charAt(col) == 'Q') {
                return false;
            }
        }
        for (int i = row-1, j = col-1; i >= 0 && j >= 0; i--, j--) {
            if (path.get(i).charAt(j) == 'Q'){
                return false;
            }
        }
        for (int i = row-1, j = col+1; i >= 0 && j < n; i--, j++) {
            if (path.get(i).charAt(j) == 'Q'){
                return false;
            }
        }
        return true;
    }

    private String constructString(int n, int col) {
        StringBuilder result = new StringBuilder();
        for (int i = 0; i < n; i++) {
            if (i == col) {
                result.append("Q");
            } else {
                result.append(".");
            }
        }
        return result.toString();
    }
}

37. 解数独

class Solution {
    char[][] result = new char[9][9];
    public void solveSudoku(char[][] board) {
        backtracking(board);
        for (int i = 0; i < 9; i++) {
                for (int j = 0; j < 9; j++) {
                    board[i][j] = result[i][j];
                }
            }
    }

    private void backtracking(char[][] board) {
        if (findEmpty(board) == null) {
            for (int i = 0; i < 9; i++) {
                for (int j = 0; j < 9; j++) {
                    result[i][j] = board[i][j];
                }
            }
            return;
        }
        int[] pos = findEmpty(board);
        int row = pos[0];
        int col = pos[1];
        for (int i = 1; i < 10; i++) {
            char digit = (char) (i + '0');
            if (!isValidSudoku(row, col, digit, board)) {
                continue;
            }
            board[row][col] = digit;
            backtracking(board);
            board[row][col] = '.';
        }
    }

    private int[] findEmpty(char[][] board) {
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                if (board[i][j] == '.') {
                    return new int[]{i, j};
                }
            }
        }
        return null;
    }

    private boolean isValidSudoku(int row, int col, char val, char[][] board) {
        // Check if the same digit already exists in the same row
        for (int i = 0; i < 9; i++) {
            if (board[row][i] == val) {
                return false;
            }
        }

        // Check if the same digit already exists in the same column
        for (int j = 0; j < 9; j++) {
            if (board[j][col] == val) {
                return false;
            }
        }

        // Check if the same digit already exists in the same 3x3 grid
        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;
    }

}