33题 N-Queens

CMYing85

于 2021-05-14 20:17:25 发布

阅读量69

点赞数

分类专栏：算法文章标签： dfs 算法 Java

本文链接：https://blog.csdn.net/caomengying/article/details/116804485

版权

算法专栏收录该内容

232 篇文章 0 订阅

订阅专栏

该博客介绍了如何使用递归策略解决经典的N皇后问题，其中目标是在N×N的棋盘上放置N个皇后，使得任意两个皇后不在同一行、列或对角线上。文章详细展示了算法的核心代码，包括`solveNQueens`、`helper`、`isValid`和`Draw`四个关键方法，并返回所有不同的解决方案。

摘要由CSDN通过智能技术生成

N-Queens

Description
The N-queens puzzle is the problem of placing n queens on an n×n chessboard, and the queens can not(Any two queens can’t be in the same row, column, diagonal line).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 ‘.’ each indicate a queen and an empty space respectively.

public class Solution {
    /*
     * @param n: The number of queens
     * @return: All distinct solutions
     */
    public List<List<String>> solveNQueens(int n) {
        // write your code here
        
        List<List<String>> results = new LinkedList<>();
        if (n <= 0) { 
          return results; 
         } 
        List<Integer> cols = new ArrayList<>();
      
        helper(results, n, cols);
         return results;
      }
    public void helper(List<List<String>> results , int n, List<Integer> cols) {
    // reach solution
      if (cols.size() == n) {
        results.add(Draw(cols));
        return;
       }
      for (int i = 0; i < n; i++) {
         if(!isValid(cols, i)){
             continue ;
         }
         cols.add(i) ;
         helper(results , n, cols) ;
         cols.remove(cols.size()-1) ;
       
     }
    }
    public boolean isValid(List<Integer> cols , int i) {
      // only check rows above current one
     int row = cols.size() ;
     for(int j =0 ; j < cols.size() ; j++){
         if(i == cols.get(j)){
             return false ;
         }
         if(row + i == j + cols.get(j)){
             return false ;
         }
         if(row - i == j - cols.get(j)){
             return false ;
         }
     }
       return true;
    }
  // build solution from temporary chessboard
    public List<String> Draw(List<Integer> cols) {
       List<String> result = new ArrayList<>();
       for (int i = 0; i < cols.size(); i++) {
          StringBuilder sb = new StringBuilder() ;
          for(int j = 0; j < cols.size(); j++){
              sb.append(j == cols.get(i) ? 'Q' : '.') ;
          }
          result.add(sb.toString()) ;
        }
        return result;
    }
    
}