(java)N-Queens
来源:互联网 发布:java开发项目经验 编辑:程序博客网 时间:2024/06/04 20:14
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.."]]
思路:n皇后问题,回溯算法的最经典问题,回溯探索就行了,太简单,太经典,就直接贴代码了
代码如下(已通过leetcode)
public class Solution {
List<List<String>> lists=new ArrayList<List<String>>();
public List<List<String>> solveNQueens(int n) {
char[][] queens = new char[n][n];
for(int i = 0;i < n; i++){
for(int j = 0;j < n; j++){
queens[i][j] = '.';
}
}
genaratenqueens(queens, n,0);
return lists;
}
private void genaratenqueens(char[][] queens, int n, int row) {
// TODO Auto-generated method stub
if(row==n) {
List<String> temp=new ArrayList<String>();
for(int i=0;i<n;i++) {
temp.add(String.valueOf(queens[i]));
}
lists.add(temp);
}
for(int i=0;i<n;i++) {
if(canput(row, i, n, queens)) {
queens[row][i]='Q';
genaratenqueens(queens, n, row+1);
queens[row][i]='.';
}
}
}
public boolean canput(int x,int y,int n,char[][] queens){
int i;
int j;
for(i=0;i<n;i++) {
for(j=0;j<n;j++) {
if(Math.abs(i-x)==Math.abs(j-y)) {
if(queens[i][j]=='Q') return false;
}
}
}
i=0;
for(i=0;i<n;i++) {
if(queens[i][y]=='Q') return false;
}
return true;
}
}
- [Leetcode] N-Queens (Java)
- N-Queens II Java
- N-Queens Java
- N-Queens II (Java)
- [LeetCode][Java] N-Queens
- (java)N-Queens
- leetcode:N-Queens 【Java】
- N-Queens leetcode java
- [Leetcode] N-Queens II (Java)
- [LeetCode][Java] N-Queens II
- [leetcode-51]N-Queens(java)
- leetcode:N-Queens II 【Java】
- (Java)LeetCode-51. N-Queens
- N-Queens
- N-Queens
- N-Queens
- N-Queens
- N-Queens
- CC2541 BLE 主从模式流程
- Android PullToRefresh (ListView GridView 下拉刷新) 使用详解
- 网易 OpenStack 部署运维实战
- Java结合反射和单例的工厂模式
- JAVA——反射机制
- (java)N-Queens
- 谈UITextView、UITextField的InPutView和AccessoryInputView的便利
- ListView,GridView之LayoutAnimation特殊动画的实现
- 忘记NSURLConnection,拥抱NSURLSession
- kNN算法改进约会网站的配对效果
- Android 实现ListView的A-Z字母排序和过滤搜索功能,实现汉字转成拼音
- mysql查看执行计划
- zabbix 不能启动之非一般原因(配置的大意也可导致出错,也可以导致)
- TextView setTextColor 设置颜色失败