八皇后问题

来自剑指offer：

一维数组，下标即表示行，数组元素表示列。列不相同，排列问题。同时要满足约束条件| i-j | != | a[i]-a[j] |。

/**

 * 八皇后问题：8*8棋盘上放8个旗子，每行每列都有，且任意相邻两个不能组成对角线
 * @author Samantha
 * 
 */
public class EightQueens {


static int count = 0;


public static void main( String args[] ) {
int a[] = new int[8];
for (int i = 0; i < 8; i++) {
a[i] = i;
}

run(a, 0);
System.out.println("total result : " + count);
}


public static void print(int a[]) {
for (int i = 0; i < 8; i++)
System.out.print(a[i]);
System.out.println();
}


public static void run(int a[], int index) {
if (index == 8) {
count++;
print(a);
}


for (int i = index; i < 8; i++) {
exchange(a, i, index);
if (isQualified(a, index))
run(a, index + 1);
exchange(a, i, index);
}
}


public static boolean isQualified(int a[], int index) {
for (int i = 0; i < index; i++) {
if (Math.abs(i - index) == Math.abs(a[i] - a[index]))
return false;
}
return true;
}


public static void exchange(int a[], int i, int j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}


}