代码随想录训练营第30天|332.重新安排行程，51. N皇后，37. 解数独

)

332.重新安排行程

文章

代码随想录|0332.重新安排行程

思路

这题不会，要看卡哥
突出一个在用过的ticket上做标记
按目的地字典序升序排列tickets保证结果最小
其他细节也没啥了

代码

class Solution {

    private LinkedList<String> path;

    private List<String> res;

    public List<String> findItinerary(List<List<String>> tickets) {
        path = new LinkedList<>();
        res = new LinkedList<>();

        Collections.sort(tickets, (x, y) -> x.get(1).compareTo(y.get(1)));
        path.add("JFK");
        boolean[] used = new boolean[tickets.size()];
        dfs((ArrayList) tickets, used);
        return res;
    }

    public boolean dfs(ArrayList<List<String>> tickets, boolean[] used) {
        if (path.size() == tickets.size() + 1){
            res = new ArrayList<>(path);
            return true;
        }
        int i, n;
        n = tickets.size();
        for (i = 0; i < n; ++i) {
            if (!used[i] && path.getLast().equals(tickets.get(i).get(0))) {
                path.add(tickets.get(i).get(1));
                used[i] = true;
                if (dfs(tickets, used)) {
                    return true;
                }
                used[i] = false;
                path.removeLast();
            }
        }
        return false;
    }
}

51.N皇后

文章

代码随想录|0051.N皇后

思路

学过无数次思路，但今天还是第一次做出来
每行在可选范围内选一个，再选下一行

class Solution {

    private List<Integer> queens;

    private int scale;

    private List<List<String>> answer;

    public List<List<String>> solveNQueens(int n) {
        scale = n;
        queens = new ArrayList<>();
        answer = new ArrayList<>();
        dfs(queens);
        return answer;
    }

    public void dfs(List<Integer> queens) {
        if (queens.size() == scale) {
            answer.add(convert(queens));
            return;
        }
        int i;
        for (i = 0; i < scale; ++i) {
            if (check(queens, i)) {
                queens.add(i);
                dfs(queens);
                queens.remove(queens.size() - 1);
            }
        }
    }

    public List<String> convert(List<Integer> queens) {
        int i, j;
        List<String> res = new ArrayList<>();
        StringBuffer sb = new StringBuffer();
        for (i = 0; i < scale; ++i) {
            sb.setLength(0);
            for (j = 0; j < scale; ++j) {
                if (queens.get(i) == j) {
                    sb.append("Q");
                } else {
                    sb.append(".");
                }
            }
            res.add(sb.toString());
        }
        return res;
    } 

    public boolean check(List<Integer> queens, int col) {
        int row = queens.size();
        int i;
        int cur;
        for (i = 0; i < row; ++i) {
            cur = queens.get(i);
            if (cur == col || Math.abs(col - cur) == Math.abs(row - i)) {
                return false;
            }
        }
        return true;
    }
}

37.解数独

文章

代码随想录|0037.解数独

思路

用一维坐标表示位置，除以9和模9来确定位置
每层都从’.'开始
注意搜索的范围，同行同列同方块都不能重复

代码

class Solution {
    public void solveSudoku(char[][] board) {
        int start = nextPos(board, 0);
        dfs(board, start);
    }

    public boolean dfs(char[][] board, int pos) {
        if (pos == 81) {
            return true;
        }
        boolean[] choices = new boolean[9];
        int i, x, y, lx, uy;
        x = pos / 9;
        y = pos % 9;
        lx = (x / 3) * 3;
        uy = (y / 3) * 3;
        for (i = 0; i < 9; ++i) {
            if (board[x][i] != '.') {
                choices[board[x][i] - '1'] = true;
            }
            if (board[i][y] != '.') {
                choices[board[i][y] - '1'] = true;
            }
            if (board[lx + i / 3][uy + i % 3] != '.') {
                choices[board[lx + i / 3][uy + i % 3] - '1'] = true;
            }
        }
        for (i = 0; i < 9; ++i) {
            if (!choices[i]) {
                board[x][y] = (char) (i + '1');
                if (dfs(board, nextPos(board, pos))) {
                    return true;
                }
                board[x][y] = '.';
            }
        }
        return false;
    }

    public int nextPos(char[][] board, int pos) {
        int x, y;
        while (pos < 81) {
            x = pos / 9;
            y = pos % 9;
            if (board[x][y] == '.') {
                return pos;
            }
            ++pos;
        }
        return pos;
    }
}

总结

纯粹自我感动
六点半不到开始，快九点才做完
第一道还抄的答案
思路还挺清晰但是细节上真的会差好多