[LeetCode]N-Queens 八皇后问题扩展(经典深层搜索)
2015-08-08 19:22
537 查看
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
indicate a queen and an empty space respectively.
For example,
There exist two distinct solutions to the 4-queens puzzle:
參考:LeetCode 题解
戴方勤 (soulmachine@gmail.com)
https://github.com/soulmachine/leetcode
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.."] ]
參考:LeetCode 题解
戴方勤 (soulmachine@gmail.com)
https://github.com/soulmachine/leetcode
public class Solution { boolean[] column = null; boolean[] diag = null; boolean[] anti_diag = null; int[]C = null; String model = null; public List<String[]> solveNQueens(int n) { column = new boolean ; diag = new boolean[2*n]; anti_diag = new boolean[2*n]; C = new int ;//Q在第i行的第几列 List<String []> res = new ArrayList<>(); dfs(0,res,n); return res; } private void dfs(int row,List<String[]> res,int n){ if(row==n){ String [] str = new String ; for(int i=0;i<n;i++){ StringBuilder sb = new StringBuilder(); for(int j=0;j<n;j++){ if(C[i]==j){ sb.append("Q"); }else{ sb.append("."); } } str[i] = sb.toString(); } res.add(str); return; } for(int j=0;j<n;j++){ if(!column[j]&&!anti_diag[row+j]&&!diag[n-row-1+j]){ C[row]=j; }else{ continue; } column[j]=anti_diag[row+j]=diag[n-row-1+j]=true; dfs(row+1,res,n); column[j]=anti_diag[row+j]=diag[n-row-1+j]=false; } } }
相关文章推荐
- Reveal UI 分析工具简单使用
- Codeforces 566 F. Clique in the Divisibility Graph
- iOS开发UI篇—CAlayer层的属性
- UIViewController - View Management(视图管理)
- sendRedirect和getRequestDispatcher的一些区别
- UIScrollView+UIView无法点击
- ibatis的queyrForList和queryForMap区别
- Equidistant String (周赛2)
- UI06_UIPageControl
- 杭电 1711 Number Sequence(kmp)
- UITextField(loading...)
- 使用StoryBoard做IOS UI界面跳转
- Android 蓝牙4.0 Bluetooth BLE 写数据(修改BLE设备的属性)
- UI06_UIScrollView
- 杭电1711Number Sequence
- 找不到类FeatureQuery解决办法
- RESTful API URI 设计: 查询(Query)和标识(Identify)
- Android中使用Build获取当前系统SDK版本
- EasyUI combotree 赋值
- MINIGUI学习总结一