判断一个 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-9 和字符 '.' 。给定数独永远是 9x9 形式的。
bool isValidSudoku(char** board, int boardSize, int* boardColSize){ int **count=(int **)malloc(sizeof(int *)*3); for(int i=0;i<3;++i) { count[i]=(int *)malloc(sizeof(int)*9); for(int j=0;j<boardColSize[i];++j) { count[i][j]=0; } } int status=true; for(int i=0;i<boardSize;++i) { for(int j=0;j<boardColSize[i];j++) { if(board[i][j]=='.')continue; int area=i/3; area=area*3+j/3; int base=1<<(board[i][j]-'0'-1); int tmp=count[0][i]&base; if(tmp) { status=false; goto MATCH_END; } else { count[0][i]=count[0][i]|base; } tmp=count[1][j]&base; if(tmp) { status=false; goto MATCH_END; } else { count[1][j]=count[1][j]|base; } tmp=count[2][area]&base; if(tmp) { status=false; goto MATCH_END; } else { count[2][area]=count[2][area]|base; } } } MATCH_END: free(count[0]); free(count[1]); free(count[2]); free(count); return status; }执行用时 : 12 ms, 在Valid Sudoku的C提交中击败了98.78% 的用户
内存消耗 : 7.3 MB, 在Valid Sudoku的C提交中击败了87.88% 的用户
