leetcode 51. N-Queens

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-queens puzzle.

Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space respectively.

For example,
There exist two distinct solutions to the 4-queens puzzle:

[
 [".Q..",  // Solution 1
  "...Q",
  "Q...",
  "..Q."],

 ["..Q.",  // Solution 2
  "Q...",
  "...Q",
  ".Q.."]
]

---

题目就不用描述了吧，N皇后问题太经典了。这类NP问题时间复杂度肯定是次幂级的，所以从头到尾枚举所有可能性

public class Solution {
    public List<List<String>> solveNQueens(int n) {
        List<List<String>>res = new ArrayList<List<String>>();
        helper(n,0,new int[n],res);
        return res;
    }
    public void helper(int n,int row,int []columnForRow,List<List<String>>res){
        if(n==row){
            List<String>a = new ArrayList<String>();
            for(int i=0;i<n;i++){
                StringBuilder sb = new StringBuilder();
                for(int j=0;j<n;j++){
                    if(columnForRow[i]!=j){
                        sb.append('.');
                    }
                    else sb.append('Q');
                }
                a.add(sb.toString());
            }
            res.add(new ArrayList<String>(a));
            return ;
        }
        for(int i=0;i<n;i++){
            columnForRow[row]=i;
            if(check(row,columnForRow)){
                helper(n,row+1,columnForRow,res);
            }
        }
    }
    public boolean check(int row,int []columnForRow){
        for(int i=0;i<row;i++){
            if(columnForRow[i]==columnForRow[row]|| Math.abs(columnForRow[row]-columnForRow[i])==row-i)return false;
        }
        return true;
    }
}