Leetcode 51. N 皇后 (Day 21) JavaScript

非最优

varsolveNQueens=function(n){constans=[];constvisit=Array.from({length:n},()=>Array(n).fill("."));constdfs=(row)=>{if(row==n){constvisit0=visit.slice();for(leti=0;i<n;i++){visit0[i]=visit[i].join("");}ans.push(visit0);return;}for(letcol=0;col<n;col++){if(isQueen(row,col,visit)){visit[row][col]='Q';dfs(row+1);visit[row][col]='.';}}}constisQueen=(row,col,visit)=>{for(leti=0;i<row;i++){for(letj=0;j<n;j++){if(visit[i][j]=='Q'&&(j==col||j==col+row-i||j==col-row+i))returnfalse;}}returntrue;}dfs(0);returnans;};