N后问题

public class NQueen1 {
   static int n;      //皇后个数
   static int[] x;    //当前解
   static long sum;   //当前已找到的可行方案
   
   public static long nQueen(int nn) {
	   n = nn;
	   sum = 0;
	   x = new int[n+1];
	   for(int i = 0;i<=n;i++) {
		   x[i] = 0;
	   }
	   backtrack(1);
	   return sum;
   }
   private static void backtrack(int t) {
	   if(t>n)sum++;
	   else
		   for(int i = 1;i<=n;i++) {
			   x[t] = i;
			   if(place(t))backtrack(t+1);
		   }
   }
   private static boolean place(int k) {
	   for(int j = 1;j<k;j++)
		   if((Math.abs(k-j)==Math.abs(x[j]-x[k]))||(x[j]==x[k]))
				   return false;
	   return true;
   }
   public static void main(String[] args) {
	   Scanner input = new Scanner(System.in);
	   System.out.println("请输入皇后的个数：");
	   int nn = input.nextInt();
	   System.out.println(nQueen(nn));
	   
}
}