leetcode刷题笔记(Golang)--36. Valid Sudoku

最新推荐文章于 2021-04-26 18:53:55 发布

圆滚滚coder

最新推荐文章于 2021-04-26 18:53:55 发布

阅读量157

点赞数

分类专栏： leetcode刷题笔记(Golang) 文章标签： golang 算法 leetcode go

本文链接：https://blog.csdn.net/weixin_44555304/article/details/104234522

版权

leetcode刷题笔记(Golang) 专栏收录该内容

172 篇文章 4 订阅

订阅专栏

这是一个关于LeetCode第36题的解题笔记，使用Go语言实现验证9x9数独是否有效。有效性的判断依据包括：每一行、每一列和每个3x3宫格中数字1-9不能重复。笔记中包含两个示例输入及对应的输出，解释了当数独不满足条件时为何无效。

摘要由CSDN通过智能技术生成

36. 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.

解题参考链接Cspiration

func isValidSudoku(board [][]byte) bool {
	m := len(board)
	n := len(board[0])

	for i := 0; i < m; i++ {
		rowMap := map[byte]int{}
		colMap := map[byte]int{}
		cubeMap := map[byte]int{}

		for j := 0; j < n; j++ {
			if board[i][j] != '.' {
				if _, ok := rowMap[board[i][j]]; ok {
					return false
				}
				rowMap[board[i][j]]++
			}

			if board[j][i] != '.' {
				if _, ok := colMap[board[j][i]]; ok {
					return false
				}
				colMap[board[j][i]]++
			}

			cubeRowIndex := 3 * (i / 3)
			cubeColIndex := 3 * (i % 3)
			if board[cubeRowIndex+j/3][cubeColIndex+j%3] != '.' {
				if _, ok := cubeMap[board[cubeRowIndex+j/3][cubeColIndex+j%3]]; ok {
					return false
				}
				cubeMap[board[cubeRowIndex+j/3][cubeColIndex+j%3]]++
			}

		}
	}
	return true
}