数组（13）：数独

36 . Valid Sudoku
描述：

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Each row must contain the digits 1-9 without repetition.
Each column must contain the digits 1-9 without repetition.
Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

A partially filled sudoku which is valid.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.

分析：
Three flags are used to check whether a number appear.

used1: check each row

used2: check each column

used3: check each sub-boxes

时间复杂度：O(n2)
最优解代码：

class Solution
{
public:
    bool isValidSudoku(vector<vector<char> > &board)
    {
        int used1[9][9] = {0}, used2[9][9] = {0}, used3[9][9] = {0};

        for(int i = 0; i < board.size(); ++ i)
            for(int j = 0; j < board[i].size(); ++ j)
                if(board[i][j] != '.')
                {
                    int num = board[i][j] - '0' - 1, k = i / 3 * 3 + j / 3;
                    if(used1[i][num] || used2[j][num] || used3[k][num])
                        return false;
                    used1[i][num] = used2[j][num] = used3[k][num] = 1;
                }

        return true;
    }
};

37 . 解数独
描述：

编写一个程序，通过已填充的空格来解决数独问题。

一个数独的解法需遵循如下规则：

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
空白格用 '.' 表示。

解析：

class Solution {
public:
    bool solveSudoku(vector<vector<char>>& board) {
        for (int i = 0; i < 9; ++i)
          for (int j = 0; j < 9; ++j) {
             if (board[i][j] == '.') {
                for (int k = 0; k < 9; ++k) {
                    board[i][j] = '1' + k;
                    if (isValid(board, i, j) && solveSudoku(board))
                        return true;
                    board[i][j] = '.';
                  }
                return false;
            }
        }
    return true;
    }
private:
// 检查(x, y) 是否合法
   bool isValid(const vector<vector<char> > &board, int x, int y) {
      int i, j;
      for (i = 0; i < 9; i++) // 检查y列
          if (i != x && board[i][y] == board[x][y])
             return false;
      for (j = 0; j < 9; j++) // 检查x行
          if (j != y && board[x][j] == board[x][y])
             return false;
      for (i = 3 * (x / 3); i < 3 * (x / 3 + 1); i++)
         for (j = 3 * (y / 3); j < 3 * (y / 3 + 1); j++)
             if ((i != x || j != y) && board[i][j] == board[x][y])
                return false;
      return true;
   }
};