N-Queens II

尘埃092

于 2014-08-28 15:05:13 发布

阅读量586

点赞数

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/chenansic/article/details/38898331

版权

LeetCode 专栏收录该内容

15 篇文章

订阅专栏

class Solution {
public:
    #define N 30
    int A[N] = {0};
    int max;
    int sum;
    int canput( int k )
    {
        for( int i = 1; i < k; i++ )
        if( A[i] == A[k] || abs(i-k) == abs(A[i]-A[k]) )
            return 0;
        return 1;
    }
    int queen( int t )
    {
        if( t > max )
            sum++;
        for( int i = 1; i <= max; i++ )
        {
            A[t] = i;
            if( canput(t) )
            {
                queen(t+1);
            }
        }
        return sum;
    }
    int totalNQueens(int n) {
        max = n;
        sum = 0;
        return queen(1);
    }
};