leetcode 52. N-Queens II

Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.

这个和上一道题没什么区别，最后返回size就好

public class Solution {
    public int totalNQueens(int n) {
        List<List<String>>res = new ArrayList<List<String>>();  
        helper(n,0,new int[n],res);  
        return res.size();
    }
    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;  
    }  
}