Leetcode: Valid Sudoku

carlosten

于 2014-08-02 21:16:22 发布

阅读量147

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： algorithm 面试

本文链接：https://blog.youkuaiyun.com/carlosten/article/details/38351611

Leetcode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一个用于验证数独是否有效的算法实现。该算法检查数独的行、列及每个宫格内数字是否重复，确保符合数独的基本规则。通过遍历数独板的每个单元格，对已填充的单元格进行有效性检查。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

c++:

class Solution {
public:
    bool isvalid(int m, int n, vector<vector<char> > &board)
    {
        int i,j;
        for(i = 0;i < 9;i ++)
        {
            if(i != m && board[i][n] == board[m][n])
            {
                return false;
            }
        }
        for(j = 0;j < 9;j ++)
        {
            if(j != n && board[m][j] == board[m][n])
            {
                return false;
            }
        }
        for(i = (m/3)*3;i < (m/3)*3 + 3;i ++)
        {
            for(j = (n/3)*3;j < (n/3)*3 + 3;j ++)
            {
                if((i != m || j != n) && board[i][j] == board[m][n])
                {
                    return false;
                }
            }
        }
        return true;
    }
    bool isValidSudoku(vector<vector<char> > &board) {
        int i,j;
        for(i = 0;i < 9;i++)
        {
            for(j = 0;j < 9;j ++)
            {
                if(board[i][j] == '.')
                {
                    continue;
                }
                if(!isvalid(i,j,board))
                {
                    return false;
                }
            }
        }
        return true;
    }
};