Leetcode_n-queens-ii

最新推荐文章于 2021-02-19 14:10:53 发布

fibo_nacci

最新推荐文章于 2021-02-19 14:10:53 发布

阅读量473

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/flyupliu/article/details/23607685

版权

Leetcode 专栏收录该内容

155 篇文章 0 订阅

订阅专栏

地址：http://oj.leetcode.com/problems/n-queens-ii/

Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.

思路：跟上一题一样，应该来说是上一题的子题。重新打了一遍，只记录答案个数，一次编译错了，一次AC。

参考代码：

class Solution {
public:
    void dfs(int&ans, vector<int>vec, int n)
    {
        if(vec.size()==n)
        {
            ++ans;
            return;
        }
        if(vec.empty())
        {
            for(int i = 0; i<n; ++i)
            {
                vec.push_back(i);
                dfs(ans, vec, n);
                vec.pop_back();
            }
            return;
        }
        int num = vec.size(), diff = 0;
        vector<bool>flag(n, false);
        for(int i = 0; i<num; ++i)
        {
            diff = num - i;
            flag[vec[i]] = true;
            if(vec[i]-diff>=0)
                flag[vec[i]-diff] = true;
            if(vec[i]+diff<n)
                flag[vec[i]+diff] = true;
        }
        for(int i = 0; i<n; ++i)
        {
            if(!flag[i])
            {
                vec.push_back(i);
                dfs(ans, vec, n);
                vec.pop_back();
            }
        }
    }
    int totalNQueens(int n) {
        if(n<=0)
            return 0;
        int ans = 0;
        vector<int>vec;
        dfs(ans, vec, n);
        return ans;
    }
};

 
 
  
  class 
  
  Solution 
  
  {
 
 
 
 
  
  private
  
  :
 
 
 
 
  
      
  
  unordered_map
  
  <
  
  int
  
  , 
  
  bool
  
  >
  
  addmp
  
  , 
  
  minusmp
  
  ;
 
 
 
 
  
      
  
  string 
  
  str
  
  ;
 
 
 
 
  
      
  
  int 
  
  n
  
  ;
 
 
 
 
  
      
  
  void 
  
  dfs
  
  (
  
  int
  
  &
  
  ans
  
  , 
  
  vector
  
  <
  
  string
  
  >&
  
  vec
  
  , 
  
  vector
  
  <
  
  bool
  
  >&
  
  vrow
  
  , 
  
  vector
  
  <
  
  bool
  
  >&
  
  vcol
  
  , 
  
  int 
  
  begin
  
  )
 
 
 
 
  
      
  
  {
 
 
 
 
  
          
  
  if
  
  (
  
  begin
  
  ==
  
  n 
  
  && 
  
  vec
  
  .
  
  size
  
  ()
  
  ==
  
  n
  
  )
 
 
 
 
  
          
  
  {
 
 
 
 
  
              
  
  ++
  
  ans
  
  ;
 
 
 
 
  
              
  
  return
  
  ;
 
 
 
 
  
          
  
  }
 
 
 
 
  
          
  
  for
  
  (
  
  int 
  
  j 
  
  = 
  
  0
  
  ; 
  
  j
  
  <
  
  n
  
  ; 
  
  ++
  
  j
  
  )
 
 
 
 
  
          
  
  {
 
 
 
 
  
              
  
  if
  
  (
  
  !
  
  vrow
  
  [
  
  begin
  
  ] 
  
  && 
  
  !
  
  vcol
  
  [
  
  j
  
  ] 
  
  && 
  
  !
  
  addmp
  
  [
  
  begin
  
  +
  
  j
  
  ] 
  
  && 
  
  !
  
  minusmp
  
  [
  
  begin
  
  -
  
  j
  
  ])
 
 
 
 
  
              
  
  {
 
 
 
 
  
                  
  
  vrow
  
  [
  
  begin
  
  ] 
  
  = 
  
  vcol
  
  [
  
  j
  
  ] 
  
  = 
  
  addmp
  
  [
  
  begin
  
  +
  
  j
  
  ] 
  
  = 
  
  minusmp
  
  [
  
  begin
  
  -
  
  j
  
  ] 
  
  = 
  
  true
  
  ;
 
 
 
 
  
                  
  
  string 
  
  s 
  
  = 
  
  str
  
  ;
 
 
 
 
  
                  
  
  s
  
  [
  
  j
  
  ] 
  
  = 
  
  'Q'
  
  ;
 
 
 
 
  
                  
  
  vec
  
  .
  
  push_back
  
  (
  
  s
  
  );
 
 
 
 
  
                  
  
  dfs
  
  (
  
  ans
  
  , 
  
  vec
  
  , 
  
  vrow
  
  , 
  
  vcol
  
  , 
  
  begin
  
  +
  
  1
  
  );
 
 
 
 
  
                  
  
  vec
  
  .
  
  pop_back
  
  ();
 
 
 
 
  
                  
  
  vrow
  
  [
  
  begin
  
  ] 
  
  = 
  
  vcol
  
  [
  
  j
  
  ] 
  
  = 
  
  addmp
  
  [
  
  begin
  
  +
  
  j
  
  ] 
  
  = 
  
  minusmp
  
  [
  
  begin
  
  -
  
  j
  
  ] 
  
  = 
  
  false
  
  ;
 
 
 
 
  
              
  
  }
 
 
 
 
  
          
  
  }
 
 
 
 
  
      
  
  }
 
 
 
 
  
  public
  
  :
 
 
 
 
  
      
  
  int 
  
  totalNQueens
  
  (
  
  int 
  
  n
  
  ) 
  
  {
 
 
 
 
  
          
  
  int 
  
  ans 
  
  = 
  
  0
  
  ;
 
 
 
 
  
          
  
  if
  
  (
  
  n
  
  <
  
  1
  
  )
 
 
 
 
  
              
  
  return 
  
  0
  
  ;
 
 
 
 
  
          
  
  addmp
  
  .
  
  clear
  
  ();
 
 
 
 
  
          
  
  minusmp
  
  .
  
  clear
  
  ();
 
 
 
 
  
          
  
  this
  
  ->
  
  n 
  
  = 
  
  n
  
  ;
 
 
 
 
  
          
  
  for
  
  (
  
  int 
  
  i 
  
  = 
  
  0
  
  ; 
  
  i
  
  <
  
  n
  
  ; 
  
  ++
  
  i
  
  )
 
 
 
 
  
              
  
  str 
  
  += 
  
  '.'
  
  ;
 
 
 
 
  
          
  
  vector
  
  <
  
  bool
  
  >
  
  vrow
  
  (
  
  n
  
  , 
  
  false
  
  ), 
  
  vcol
  
  (
  
  n
  
  , 
  
  false
  
  );
 
 
 
 
  
          
  
  vector
  
  <
  
  string
  
  >
  
  vec
  
  ;
 
 
 
 
  
          
  
  dfs
  
  (
  
  ans
  
  , 
  
  vec
  
  , 
  
  vrow
  
  , 
  
  vcol
  
  , 
  
  0
  
  );
 
 
 
 
  
          
  
  return 
  
  ans
  
  ;
 
 
 
 
  
      
  
  }
 
 
 
 
  
  };