LEETCODE: N-Queens

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-queens puzzle.

Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space respectively.

For example,
There exist two distinct solutions to the 4-queens puzzle:

[
 [".Q..",  // Solution 1
  "...Q",
  "Q...",
  "..Q."],

 ["..Q.",  // Solution 2
  "Q...",
  "...Q",
  ".Q.."]
]

多年以后，终于可以很快地写出八皇后问题的答案。

递归回溯！！！什么时候能把非递归版本也速度搞定就完美了。

class Solution {
public:
   struct Position {
      int x;
      int y;
      Position(int _x, int _y) : x(_x), y(_y) {}
   };

   bool canPutQueen(int current, int row, vector<Position>& vp) {
      for(int ii = 0; ii < current; ii ++) {
         if(vp[ii].x == current || vp[ii].y == row || current + row == vp[ii].x + vp[ii].y || current - row == vp[ii].x - vp[ii].y)
         {
            return false;
         }
      }
      return true;
   }

   void NQueens(int current, int size, vector<Position>& vp, vector<vector<string> > &results)
   {
      if(current == size) {
         string resp(size, '.');
         vector<string> res(size, resp);
         for(int ii = 0; ii < vp.size(); ii ++) {
            res[ii][vp[ii].y] = 'Q';
         }
         results.push_back(res);
         return;
      }

      for(int ii = 0; ii < size; ii ++) {
         if(canPutQueen(current, ii, vp)) {
            vp.push_back(Position(current, ii));
            NQueens(current + 1, size, vp, results);
            vp.pop_back();
         }
      }
   }

   vector<vector<string> > solveNQueens(int n) {
      vector<Position> vp;
      vector<vector<string> > results;
      NQueens(0, n, vp, results);
      return results;
   }
};