LeetCode 36 Valid Sudoku

Problem:

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

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

A partially filled sudoku which is valid.

Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

Summary:

判断当前给出的数独是否满足条件。

Solution:

横向，纵向，每个3*3小方格分别判断。

 class Solution {
 public:
     bool isValidSudoku(vector<vector<char>> board) {
         int validRow[] = {  }, validCol[] = {  };
         int validSqr[] = {  };

         for (int i = ; i < ; i++) {
             memset(validRow, , sizeof(validRow));
             memset(validCol, , sizeof(validCol));

             for (int j = ; j < ; j++) {
                 if (board[i][j] != '.') {
                     char tmp = board[i][j];
                     if (!validRow[tmp - '' - ]) {
                         validRow[tmp - '' - ]++;
                     }
                     else {
                         return false;
                     }
                 }

                 if (board[j][i] != '.') {
                     char tmp = board[j][i];
                     if (!validCol[tmp - '' - ]) {
                         validCol[tmp - '' - ]++;
                     }
                     else {
                         return false;
                     }
                 }
             }
         }

         for (int m = ; m < ; m++) {
             for (int n = ; n < ; n++) {
                 memset(validSqr, , sizeof(validSqr));

                 for (int i = m * ; i < m *  + ; i++) {
                     for (int j = n * ; j < n *  + ; j++) {
                         if (board[i][j] != '.') {
                             char tmp = board[i][j];
                             if (!validSqr[tmp - '' - ]) {
                                 validSqr[tmp - '' - ]++;
                             }
                             else {
                                 return false;
                             }
                         }

                     }
                 }
             }
         }

         return true;
     }

 };