N皇后问题

package algorithm;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

public class NQueen {
    static List<List<String>> res = new ArrayList<>();
    static LinkedList<String> list = new LinkedList<>();
    static char[][] nqueen;

    public static void main(String[] args) {
        List<List<String>> lists = nQueen(8);
        lists.forEach(System.out::println);
        System.out.println(lists.size());
    }

    private static List<List<String>> nQueen(int n) {
        nqueen = new char[n][n];
        for (char[] chars : nqueen) {
            Arrays.fill(chars, '.');
        }
        backtrack(n, 0);
        return res;
    }

    private static void backtrack(int n, int depth) {
        if (list.size() == n) {
            res.add(new ArrayList<>(list));
            return;
        }

        for (int i = 0; i < n; i++) {
            if (isValid(depth, i)) {
                nqueen[depth][i] = 'Q';
                list.add(Arrays.toString(nqueen[depth]));
                backtrack(n, depth + 1);
                nqueen[depth][i] = '.';
                list.removeLast();
            }
        }
    }

    private static boolean isValid(int depth, int index) {
        for (int i = 0; i < depth; i++) {
            if (nqueen[i][index] == 'Q') {
                return false;
            }
        }

        for (int i = depth - 1, j = 1; i >= 0 && index - j >= 0; i--, j++) {
            if (nqueen[i][index - j] == 'Q') {
                return false;
            }
        }

        for (int i = depth - 1, j = 1; i >= 0 && index + j < nqueen.length; i--, j++) {
            if (nqueen[i][index + j] == 'Q') {
                return false;
            }
        }

        return true;
    }
}