一天一算法（18）：有效的数独

题目

有效的数独
判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。

数独部分空格内已填入了数字，空白格用 ‘.’ 表示。
示例 1:

输入:
[
[“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”]
]
输出: true
示例 2:

输入:
[
[“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”]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。
但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:
1、一个有效的数独（部分已被填充）不一定是可解的。
2、只需要根据以上规则，验证已经填入的数字是否有效即可。
3、给定数独序列只包含数字 1-9 和字符 ‘.’ 。
4、给定数独永远是 9x9 形式的。

大佬的代码

public class Solution {
    public bool IsValidSudoku(char[,] board) {
        for(int i = 0; i < 9; ++i){
            HashSet<int> row = new HashSet<int>();
            HashSet<int> column = new HashSet<int>();
            HashSet<int> block = new HashSet<int>();
            for(int j = 0; j < 9; ++j){
                if(board[i, j] != '.' && !row.Add(board[i, j]))
                    return false;
                if(board[j, i] != '.' && !column.Add(board[j, i]))
                    return false;
                int x = (i / 3) * 3 + j / 3;
                int y = (i % 3) * 3 + j % 3;
                if(board[x, y] != '.' && !block.Add(board[x, y]))
                    return false;
            }
        }
        return true;
    }
}

我的代码

 public bool IsValidSudoku(char[][] board) {
        HashSet<char> hash=new HashSet<char>();
        return (LineCompare(board,hash) && ColumnCompare(board,hash) && ThreeCompare(board,0,0,hash));
    }
    private bool LineCompare(char[][] a,HashSet<char> hash)
    {
        
        for(int i=0;i<a.Length;i++)
        {
            hash.Clear();
            for(int j=0;j<a[i].Length;j++)
            {
                if(!a[i][j].Equals('.'))
                {
                    if(!hash.Add(a[i][j]))
                    {
                        return false;
                    }
                }
            }
        }
        return true;
    }
    private bool ColumnCompare(char[][] a,HashSet<char> hash)
    {
         for(int i=0;i<9;i++)
         {
             hash.Clear();
             for(int j=0;j<9;j++)
             {
                 if(a[j][i]!='.')
                 {
                     if(!hash.Add(a[j][i]))
                     {
                         return false;
                     }
                 }
             }
         }
        return true;
    }
    private bool ThreeCompare(char[][]a,int rIndex,int cIndex,HashSet<char> hash)
    {
        
        while(rIndex<9)
        {
           while(cIndex<9)
           {
               hash.Clear();
               for(int i=rIndex;i-rIndex<3;i++)
               {
                   for(int j=cIndex;j-cIndex<3;j++)
                   {
                       if(a[i][j]!='.')
                       {
                           if(!hash.Add(a[i][j]))
                           {
                               return false;
                           }
                       }
                   }
               }
               cIndex=cIndex+3;
           }
           cIndex=0;
           rIndex=rIndex+3;
        } 
       return true;
    }