0036._Valid_Sudoku.md

36. Valid Sudoku

难度:Medium

刷题内容

原题连接

• https://leetcode.com/problems/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 '.'.
Example 1:

Input:
[
  ["5","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
Output: true
Example 2:

Input:
[
  ["8","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
Output: false
Explanation: Same as Example 1, except with the 5 in the top left corner being 
    modified to 8. Since there are two 8's in the top left 3x3 sub-box, it is invalid.
Note:

A Sudoku board (partially filled) could be valid but is not necessarily solvable.
Only the filled cells need to be validated according to the mentioned rules.
The given board contain only digits 1-9 and the character '.'.
The given board size is always 9x9.

思路1 - 时间复杂度: O(n^2)- 空间复杂度: O(1)******

由于board是9x9的，实际的时间复杂度也是9x9的。这里我们只要分别判断每行每列和每9个小方块内是否有重复的数即可。难度不大。

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
              int arr[9][9];
        int arr1[9][9];
        int arr2[9][9];
        memset(arr,0,sizeof(arr));
        memset(arr2,0,sizeof(arr1));
        memset(arr1,0,sizeof(arr1));
        for(int i = 0;i < 9;++i)
            for(int j = 0;j < 9;++j)
                if(board[i][j] != '.')
                {
                    if(arr[i][board[i][j] - '1'] || arr1[j][board[i][j] -'1'] ||  arr2[3 * (i / 3) + (j / 3)][board[i][j] -'1'])
                     return 0;
                    arr[i][board[i][j] - '1'] = 1;
                    arr1[j][board[i][j] -'1'] = 1;
                    arr2[3 * (i / 3) + (j / 3)][board[i][j] -'1'] = 1;
                }
        return 1;
    }
};