LeetCode 117 Valid Sudoku

JavyZheng

于 2014-10-31 15:25:10 发布

阅读量676

点赞数

分类专栏： LeetCode 文章标签： LeetCode Valid Sudoku

本文链接：https://blog.csdn.net/javyzheng/article/details/40655185

版权

LeetCode 专栏收录该内容

151 篇文章 0 订阅

订阅专栏

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.

分析：

这个比上一题简单，就是判断每一个位置是否合法就可以了。

public class Solution {
    public boolean isValidSudoku(char[][] board) {
        if(board==null || board.length!=9 || board[0].length!=9)
            return false;
            
        for(int i=0; i<9; i++){
            for(int j=0; j<9; j++){
                if(board[i][j]=='.')
                    continue;
                if(!isValid(board, i, j))
                    return false;
            }
        }
        return true;
    }
    //判断当前放置是否合法
    public boolean isValid(char[][] board, int i, int j){
        //行
        for(int k=0; k<9; k++){
            if(k!=j && board[i][k]==board[i][j])
                return false;
        }
        //列
        for(int k=0; k<9; k++){
            if(k!=i && board[k][j]==board[i][j])
                return false;
        }
        //所在的九宫格
        for(int row=i/3*3; row<i/3*3+3; row++){
            for(int col=j/3*3; col<j/3*3+3; col++){
                if((row!=i||col!=j) && board[row][col]==board[i][j])
                    return false;
            }
        }
        return true;
    }
}