【leetcode0051&0052】N皇后&N皇后2

小技巧

回溯法
字符数组转化为字符串

思路

代码

N皇后I

private List<List<String>> res=new ArrayList<>();
	
	
	public List<List<String>> solveNQueens(int n) {
		char[][] board=new char[n][n];
		for (char[] chars : board) Arrays.fill(chars, '.');//初始化
		backtrack(board,0,n);
		return res;
	}
	
	public boolean rule(char[][] board,int row,int col,int n) {
		for(int i=0;i<n;i++) {
			if(board[i][col]=='Q')
				return false;//查询同一列是否有Q
		}
		for (int i = row - 1, j = col + 1; i >= 0 && j < n; i--, j++) {
            if (board[i][j] == 'Q') return false;
        }
		for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; i--, j--) {
            if (board[i][j] == 'Q') return false;
        }//两条对角线
		
		return true;
	}
	
	void backtrack(char[][] board,int row,int n) {
		if(row==n) {
			List<String> list=new ArrayList<>();
			
			for(char[] chars:board) {
				String temp=new String(chars);
				list.add(temp);
			}
			res.add(list);
			return;
		
		}
		for(int col=0;col<n;col++) {
			if(rule(board,row,col,n)) {
				board[row][col]='Q';
				backtrack(board,row+1,n);
				board[row][col]='.';
			}
		}
	}

N皇后II

private int res;
	public int totalNQueens(int n) {
		char[][] board = new char[n][n];
		for (char[] chars : board)
			Arrays.fill(chars, '.');// 初始化
		backtrack(board, 0, n);
		return res;
	}
	public boolean rule(char[][] board,int row,int col,int n) {
		for(int i=0;i<n;i++) {
			if(board[i][col]=='Q')
				return false;//查询同一列是否有Q
		}
		for (int i = row - 1, j = col + 1; i >= 0 && j < n; i--, j++) {
            if (board[i][j] == 'Q') return false;
        }
		for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; i--, j--) {
            if (board[i][j] == 'Q') return false;
        }//两条对角线
		
		return true;
	}
	void backtrack(char[][] board,int row,int n) {
		if(row==n) {
			res++;
			return;
		
		}
		for(int col=0;col<n;col++) {
			if(rule(board,row,col,n)) {
				board[row][col]='Q';
				backtrack(board,row+1,n);
				board[row][col]='.';
			}
		}
	}

参考

https://leetcode-cn.com/problems/n-queens/solution/hui-su-suan-fa-xiang-jie-by-labuladong/