八皇后问题递归求解

public class EightQueen {

    public static int count;
    public static int max = 8;
    public static int[] row = new int[max];

    public static void main(String[] args) {
        check(0);
        System.out.println("一共有" + count + "种解法~");
    }

    /**
     * 放置第n个皇后
     */
    public static void check(int n) {
        if (n == 8) {
            count++;
            print();
            return;
        }
        for (int i = 0; i < max; i++) {
            row[n] = i;
            if (judge(n)) { //如果不冲突
                check(n + 1);
            }
        }
    }

    /**
     * 判断当前放置的皇后跟之前的是否在同一列或者一条斜线上
     */
    public static boolean judge(int n) {
        for (int i = 0; i < n; i++) {
            //如果和之前放置的皇后在同一行或者同一列
            if (row[i] == row[n] || Math.abs(n - i) == Math.abs(row[i] - row[n])) {
                return false;
            }
        }
        return true;
    }

    public static void print() {
        for (int data : row) {
            System.out.print(data + " ");
        }
        System.out.println();
    }

}