LeetCode--N-Queens II
2014-09-04 21:07
267 查看
dfs
class Solution { public: int res; int totalNQueens(int n) { res = 0; vector<int> arr(n); dfs(arr,0,n); return res; } void dfs(vector<int> &arr,int index,int N){ for(int i = 0 ; i < N ; ++i){ arr[index] = i; if(isOk(arr,index)){ if(index == N-1){ res++; } else{ dfs(arr,index+1,N); } } } } bool isOk(const vector<int> &arr,int index){ for(int i = 0 ; i < index ; ++i){ if(arr[i] == arr[index] || abs(i-index)==abs(arr[i]-arr[index])){ return false; } } return true; } };
相关文章推荐
- leetcode 052 —— N-Queens II
- Leetcode: N-Queens II
- LeetCode No.52 N-Queens II
- [leetcode]N-Queens II
- [Leetcode] 52. N-Queens II 解题报告
- LeetCode 51 - N-Queens II
- Leetcode: N-Queens II
- LeetCode | N-Queens II
- LeetCode——N-Queens II
- [LeetCode]N-Queens II
- N-Queens And N-Queens II [LeetCode] + Generate Parentheses[LeetCode] + 回溯法
- 【LeetCode】52. N-Queens II
- leetcode N-Queens/N-Queens II, backtracking, hdu 2553 count N-Queens, dfs
- leetcode[52]:N-Queens II
- leetcode - N-Queens II
- LeetCode N-Queens II
- Leetcode:N-Queens II
- leetcode 52. N-Queens II
- leetcode 51.N-Queens & 52. N-Queens II
- leetcode-52-N-Queens II