java資料結構學習筆記-八皇後問題

public class Queen {
    int count=0;
    int max=8;
    int[]array=new int[8];
    public static void main(String args[]){
        Queen queen=new Queen();
        queen.check(0);
        System.out.println(queen.count);
    }
    public  void check(int n){
        if (n==max){
            count++;
            print();
            return;
        }
        for(int i=0;i<max;i++){
            array[n]=i;
            if(judge(n)){
                check(n+1);
            }
        }
    }
    public  boolean judge(int n){
        for (int i=0;i<n;i++){
            if (array[i]==array[n]||Math.abs(n-i)==Math.abs(array[i]-array[n])){
                return false;
            }
        }
        return true;
    }
    public void print(){
        for (int i=0;i<max;i++){
            System.out.print(array[i]);
        }
        System.out.println();
    }

}
           

共勉！