https://leetcode.com/submissions/detail/124893020/
83%的成绩,其实程序不难,但很久没写N Queen问题了
var solveNQueens = function(n) { arr_l=[]; arr=[]; search(0); function search(i){ if(i==n){ arr1=[]; for(var i=0;i<n;i++){ arr1[i]=""; for(var j=0;j<n;j++){ if(arr[i]==j){ arr1[i]+='Q'; }else{ arr1[i]+='.'; } } } arr_l.push(arr1); return ; } for(var j=0;j<n;j++){ flag=0; arr[i]=j; for(var k=0;k<i;k++){ if(arr[k]==j || Math.abs(k-i)==Math.abs(arr[k]-arr[i]) ){ flag=1; break; } } if(flag==0){ search(i+1); } } } return arr_l; }; console.log(solveNQueens(4));