【数据结构】回溯法--8皇后问题

public class EightQueen {
    private int[] result = new int[8];

    // 第n行
    private void calEightQueen(int row) {
        if (row == 8) {
            printResult(result);
            return;
        }
        // 从当前行开始
        for (int con = 0; con < 8; con++) {
            if (isOk(row, con)) {
                result[row] = con;
                calEightQueen(row + 1);
            }
        }

    }

    private boolean isOk(int row, int con) {
        // 从当前行，开始往上回溯，判断两个对角是否有数据
        int left = con - 1;
        int right = con + 1;
        for (int i = row - 1; i >= 0; i--) {
            if (result[i] == con) {
                return false;
            }
            if (left >= 0) {
                if (result[i] == left) {
                    return false;
                }
            }

            if (right < 8) {
                if (result[i] == right) {
                    return false;
                }
            }
            left--;
            right++;

        }
        return true;

    }

    private void printResult(int[] result) {
    }

}