LeetCode: N-Queens II
2012-10-09 00:04
381 查看
Follow up for N-Queens problem.
Now, instead outputting board configurations, return the total number of distinct solutions.
递归解法:
Now, instead outputting board configurations, return the total number of distinct solutions.
递归解法:
class Solution { public: bool check(int row, int* place) { for (int i = 0; i < row; ++i) { int diff = abs(place[i] - place[row]); if (diff == 0 || diff == row - i) return false; } return true; } void placeQueens(int row, int n, int &count, int* place) { if (row == n) { ++count; return; } for (int i = 0; i < n; ++i) { place[row] = i; if (check(row, place)) placeQueens(row+1, n, count, place); } } int totalNQueens(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int* place = new int ; int count = 0; placeQueens(0, n, count, place); return count; } };
相关文章推荐
- Leetcode N-Queens II
- leetcode第一刷_N-Queens II
- leetcode:N-Queens II
- leetcode 52. N-Queens II
- Leetcode 52. N-Queens II (Hard) (cpp)
- (Java)LeetCode-52. N-Queens II
- [LeetCode60]N-Queens II
- [leetcode] N-Queens II
- 【LeetCode】N-Queens && N-Queens II
- Leetcode-N-Queens II
- 【LeetCode with Python】 N-Queens II
- LeetCode 52. N-Queens II 题解(C++)
- [LeetCode] N-Queens II
- LeetCode||52. N-Queens II
- [LeetCode]N-Queens II
- Leetcode204: N-Queens II
- [LeetCode]N-Queens II
- LeetCode - 52. N-Queens II
- LeetCode --- 52. N-Queens II
- Leetcode N-Queens II