LeetCode 51. N 皇后

题目链接：

力扣https://leetcode-cn.com/problems/n-queens/

【分析】这道题和52的唯一区别就是要输出皇后的位置，仍然是用回溯法。

class Solution {
        int m;
    List<List<String>> ans = new ArrayList();

    public boolean is(int x, int y, int a, int b){
        if(Math.abs(y - b) == Math.abs(x - a)) return true;
        return false;
    }

    public void backTrack(int t, int arr[]){
        if(t == m) {
            List<String> strs = new ArrayList<>();
            for(int i = 0; i < t; i++){
                String tmp = "";
                for(int j = 0; j < t; j++){
                    if(j == arr[i]) tmp += "Q";
                    else tmp += ".";
                }
                strs.add(tmp);
//                System.out.print(arr[i]);
//                System.out.print(" ");
//                System.out.println(tmp);
            }
            ans.add(strs);
//            System.out.println();
            return;
        }
        for(int i = 0; i < m; i++){
            int flag = 1;
            for(int j = 0; j < t; j++){
                if(i == arr[j] || is(j, arr[j], t, i)) {
                    flag = 0; break;
                }
            }
            if(flag == 1){
                arr[t] = i;
                backTrack(t + 1, arr);
                arr[t] = -1;
            }
        }
    }

    public List<List<String>> solveNQueens(int n) {
        m = n;
        int[] arr = new int[n];
        for(int i = 0; i < n; i++) arr[i] = -1;
        backTrack(0, arr);
        return ans;
    }
}