commit solution 36

Author: lxlxw

index-tags.md

@@ -52,6 +52,7 @@
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [1](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/1-99/0001.two-sum/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  | ✅ |
+|  [36](https://leetcode-cn.com/problems/valid-sudoku)  |  [有效的数独](/solution/1-99/0036.valid-sudoku/)  |  `哈希表`  |  <font color=blue>中等</font>  |✅ |
 |  [136](https://leetcode-cn.com/problems/single-number)  |  [只出现一次的数字](/solution/100-199/0136.single-number/)  |  `位运算`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/200-299/0217.contains-duplicate/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |

index-type.md

@@ -423,7 +423,7 @@
 |  [31](https://leetcode-cn.com/problems/next-permutation)  |  [下一个排列](/solution/1-99/0031.next-permutation/)  |  `数组`  |  <font color=blue>中等</font>  |
 |  [33](https://leetcode-cn.com/problems/search-in-rotated-sorted-array)  |  [搜索旋转排序数组](/solution/1-99/0033.search-in-rotated-sorted-array/)  |  `数组`,`二分查找`  |  <font color=blue>中等</font>  |
 |  [34](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array)  |  [在排序数组中查找元素的第一个和最后一个位置](/solution/1-99/0034.find-first-and-last-position-of-element-in-sorted-array/)  |  `数组`,`二分查找`  |  <font color=blue>中等</font>  |
-|  [36](https://leetcode-cn.com/problems/valid-sudoku)  |  [有效的数独](/solution/1-99/0036.valid-sudoku/)  |  `哈希表`  |  <font color=blue>中等</font>  |
+|  [36](https://leetcode-cn.com/problems/valid-sudoku)  |  [有效的数独](/solution/1-99/0036.valid-sudoku/)  |  `哈希表`  |  <font color=blue>中等</font>  |✅ |
 |  [39](https://leetcode-cn.com/problems/combination-sum)  |  [组合总和](/solution/1-99/0039.combination-sum/)  |  `数组`,`回溯算法`  |  <font color=blue>中等</font>  |
 |  [40](https://leetcode-cn.com/problems/combination-sum-ii)  |  [组合总和 ii](/solution/1-99/0040.combination-sum-ii/)  |  `数组`,`回溯算法`  |  <font color=blue>中等</font>  |
 |  [43](https://leetcode-cn.com/problems/multiply-strings)  |  [字符串相乘](/solution/1-99/0043.multiply-strings/)  |  `数学`,`字符串`  |  <font color=blue>中等</font>  |

solution/1-99/0036.valid-sudoku/README.md

@@ -1,7 +1,7 @@
 # [36. 有效的数独](https://leetcode-cn.com/problems/valid-sudoku)
 
 ### 题目描述
-<!-- 这里写题目描述 -->
+
 <p>判断一个&nbsp;9x9 的数独是否有效。只需要<strong>根据以下规则</strong>，验证已经填入的数字是否有效即可。</p>
 
 <ol>
@@ -67,12 +67,33 @@
 
 ### 具体解法
 
-<!-- tabs:start -->
 
 #### **Golang**
 ```go
-
+func isValidSudoku(board [][]byte) bool {
+	// ascii 1-9 = 48-57
+	var row, col, block [9][58]bool
+	for k, nums := range board {
+		for i, v := range nums {
+			if v == '.' {
+				continue
+			}
+			if row[i][v] {
+				return false
+			}
+			if col[k][v] {
+				return false
+			}
+			if block[i/3+k/3*3][v] {
+				return false
+			}
+			row[i][v] = true
+			col[k][v] = true
+			block[i/3+k/3*3][v] = true
+		}
+	}
+	return true
+}
 ```
 
-<!-- tabs:end -->
 

solution/1-99/0036.valid-sudoku/solution.go

@@ -0,0 +1,35 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=36 lang=golang
+ *
+ * [36] 有效的数独
+ */
+
+// @lc code=start
+func isValidSudoku(board [][]byte) bool {
+	// ascii 1-9 = 48-57
+	var row, col, block [9][58]bool
+	for k, nums := range board {
+		for i, v := range nums {
+			if v == '.' {
+				continue
+			}
+			if row[i][v] {
+				return false
+			}
+			if col[k][v] {
+				return false
+			}
+			if block[i/3+k/3*3][v] {
+				return false
+			}
+			row[i][v] = true
+			col[k][v] = true
+			block[i/3+k/3*3][v] = true
+		}
+	}
+	return true
+}
+
+// @lc code=end

solution/1-99/0036.valid-sudoku/solution_test.go

@@ -0,0 +1,25 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestIsValidSudoku(t *testing.T) {
+	var ret bool
+	var nums [][]byte
+	ret = true
+	nums = [][]byte{
+		{'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'},
+	}
+	if ret != isValidSudoku(nums) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+}

solution/1-99/_sidebar.md

@@ -41,7 +41,7 @@
     - [33. 搜索旋转排序数组](solution/1-99/0033.search-in-rotated-sorted-array/)
     - [34. 在排序数组中查找元素的第一个和最后一个位置](solution/1-99/0034.find-first-and-last-position-of-element-in-sorted-array/)
     - [35. 搜索插入位置 ✅](solution/1-99/0035.search-insert-position/)
-    - [36. 有效的数独](solution/1-99/0036.valid-sudoku/)
+    - [36. 有效的数独 ✅](solution/1-99/0036.valid-sudoku/)
     - [37. 解数独](solution/1-99/0037.sudoku-solver/)
     - [38. 外观数列](solution/1-99/0038.count-and-say/)
     - [39. 组合总和](solution/1-99/0039.combination-sum/)