首页 > 代码库 > [leetcode]N-Queens II
[leetcode]N-Queens II
问题描写叙述:
Follow up for N-Queens problem.
Now, instead outputting board configurations, return the total number of distinct solutions.
(N-Queens problem can see here )
基本思路:
可參照N-Queens问题。依照N-Queens 问题稍作改动就可以。
代码:
public class Solution { //java public int result; public boolean check_pos(int index, int loop, int [] record){ for(int i = 0; i < index; i++){ if(record[i] == loop) return false ; if(record[i]+i == index + loop) return false ; if(record[i] -loop == i - index ) return false ; } return true; } public void subNQueen(int [] record,int index, int n){ if(index == n){ result++; } for(int loop = 1; loop <=n; loop++){ if(check_pos(index, loop, record)){ record[index] = loop; subNQueen(record,index+1,n); record[index] = 0; } } } public int totalNQueens(int n) { int index = 0; int [] record = new int[n]; subNQueen(record,0,n); return result; } }
[leetcode]N-Queens II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。