leetcode:N-Queens 【Java】
2016-03-15 16:12
513 查看
一、问题描述
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
![](http://img.blog.csdn.net/20160315161020202)
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
indicate a queen and an empty space respectively.
For example,
There exist two distinct solutions to the 4-queens puzzle:
二、问题分析
1、采用回溯算法;
2、找到一个可行解之后,还需要继续搜索。
三、算法代码
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.."] ]
二、问题分析
1、采用回溯算法;
2、找到一个可行解之后,还需要继续搜索。
三、算法代码
public class Solution { public List<List<String>> solveNQueens(int n) { List<List<String>> result = new ArrayList<>(); if (n <= 0) return result; char[][] board = new char ; for (char[] row : board) { Arrays.fill(row, '.'); } boolean[] col_occupied = new boolean ; placeQueen(result, board, col_occupied, 0, n); return result; } private void placeQueen(List<List<String>> result, char[][] board, boolean[] col_occupied, int rowNum, int n) { if (rowNum == n) { List<String> list = new ArrayList<String>(); for (char[] row : board) { list.add(new String(row)); } result.add(list); return; } for (int colNum=0; colNum<n; colNum++) { if (isValid(board, col_occupied, rowNum, colNum, n)){ board[rowNum][colNum] = 'Q'; col_occupied[colNum] = true; placeQueen(result, board, col_occupied, rowNum+1, n); board[rowNum][colNum] = '.'; //回溯,尝试皇后rowNum的下一个位置 col_occupied[colNum] = false; } } } private boolean isValid(char[][]board, boolean[] col_occupied, int row, int col, int n) { if (col_occupied[col]) return false; for (int i=1; row-i>=0 && col-i>=0; i++) { if (board[row-i][col-i] == 'Q') return false;//反对角斜线 } for (int i=1; row-i>=0 && col+i<n; i++) { if (board[row-i][col+i] == 'Q') return false;//正对角斜线 } return true; } }
相关文章推荐
- iOS-UIView 之 layoutMargins & preservesSuperviewLayoutMargins 解惑
- 10个顶级的CSS UI开源框架
- getBuiltInDisplay
- 158.Which statements are true regarding the FOR UPDATE clause in a SELECT statement? (Choose all tha
- NSBundleResourceRequest
- iOS 7及以上,随时改变UIStatusBar颜色
- iOS边练边学--UITableViewCell的常见属性设置
- iOS开发之UITextView,设置textView的行间距及placeholder
- ERROR: '/usr/local/bin' is not writable - it is required for Homebrew, try 'brew doctor' to fix it!
- Android Volley完全解析(三),定制自己的Request
- 从零开始学习EasyDarwin之无锁队列
- com.android.build.api.transform.TransformException: com.android.builder.packaging.DuplicateFileExcep
- Java 工具类 ToStringBuilder
- 给按钮UIButton设置图片,setBackGroundImage和setImage两个方法的区别
- quilt.mk源码
- 创建请求集
- UIKeyboard 键盘
- Java.util.concurrent包学习(一) BlockingQueue接口
- 错误将UIViewController当做UITableViewController来用
- OCiOS开发:UIKit 力学(UIDynamics)(一)