[Leetcode] N-Queens II (Java)
来源:互联网 发布:steam数据 编辑:程序博客网 时间:2024/06/07 12:53
Follow up for N-Queens problem.
Now, instead outputting board configurations, return the total number of distinct solutions.
找出N皇后的解的个数,依然DFS
public class Solution {private int res=0; public int totalNQueens(int n) {char[][] chars = new char[n][n];for(int i=0;i<n;i++){for(int j=0;j<n;j++){chars[i][j]='.';}}dfs(chars,0,n); return res; } private void dfs(char[][] chars,int index,int n){if(index==n){res++;return;}for(int i=0;i<chars[index].length;i++){if(check(chars,index,i)){chars[index][i]='Q';dfs(chars,index+1, n);chars[index][i]='.';}}}private boolean check(char[][] chars, int index, int pivot) {for(int i=0;i<index;i++){if(chars[i][pivot]=='Q')return false;}for(int i=index-1, j=pivot-1;i>=0&&j>=0;i--,j--){if(chars[i][j]=='Q')return false;}for(int i=index-1, j=pivot+1;i>=0&&j<chars[i].length;i--,j++){if(chars[i][j]=='Q')return false;}return true;}}
0 0
- [Leetcode] N-Queens II (Java)
- [LeetCode][Java] N-Queens II
- leetcode:N-Queens II 【Java】
- LeetCode: N-Queens II
- LeetCode : N-Queens II
- [Leetcode] N-Queens II
- 【leetcode】N-Queens II
- LeetCode: N Queens II
- [LeetCode]N-Queens II
- LeetCode - N-Queens II
- LeetCode:N-Queens II
- 【leetcode】N-Queens II
- LeetCode:N-Queens II
- Leetcode: N-Queens II
- leetcode N-Queens II
- LeetCode | N-Queens II
- Leetcode: N-Queens II
- LeetCode N-Queens II
- 使用Apache的ab工具进行压力测试
- IOS UIButton事件
- django South 使用
- 关于 WebBrowser只对浏览器外应用程序以及在Internet Explorer 中以提升权限运行的应用程序启用
- 百度LBS 常用问题总结
- [Leetcode] N-Queens II (Java)
- Spring中Quartz的配置
- MIPI DIsplay Panel And Linux Driver Model .
- 关于openfire+spark连不上同一局域网的其他机子
- CarreerCup Sort Height
- mysql分表的3种方法
- WEB前端开发工程师前期准备阶段
- LR性能测试经验总结(持续跟新中)
- linux u盘不识别解决办法