commit solution 136

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>  | ✅ |
+|  [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>  |✅ |
 
@@ -103,6 +104,7 @@
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
+|  [136](https://leetcode-cn.com/problems/single-number)  |  [只出现一次的数字](/solution/100-199/0136.single-number/)  |  `位运算`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [169](https://leetcode-cn.com/problems/majority-element)  |  [多数元素](/solution/100-199/0169.majority-element/)  |  `位运算`,`数组`,`分治算法`  |  <font color=green>简单</font>  |✅ |
 |  [268](https://leetcode-cn.com/problems/missing-number)  |  [缺失数字](/solution/200-299/0268.missing-number/)  |  `位运算`,`数组`,`数学`  |  <font color=green>简单</font>  |✅ |
 

index-type.md

@@ -40,7 +40,7 @@
 |  [121](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock)  |  [买卖股票的最佳时机](/solution/100-199/0121.best-time-to-buy-and-sell-stock/)  |  `数组`,`动态规划`  |  <font color=green>简单</font>  |
 |  [122](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii)  |  [买卖股票的最佳时机 ii](/solution/100-199/0122.best-time-to-buy-and-sell-stock-ii/)  |  `贪心算法`,`数组`  |  <font color=green>简单</font>  |
 |  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
-|  [136](https://leetcode-cn.com/problems/single-number)  |  [只出现一次的数字](/solution/100-199/0136.single-number/)  |  `位运算`,`哈希表`  |  <font color=green>简单</font>  |
+|  [136](https://leetcode-cn.com/problems/single-number)  |  [只出现一次的数字](/solution/100-199/0136.single-number/)  |  `位运算`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [141](https://leetcode-cn.com/problems/linked-list-cycle)  |  [环形链表](/solution/100-199/0141.linked-list-cycle/)  |  `链表`,`双指针`  |  <font color=green>简单</font>  |
 |  [155](https://leetcode-cn.com/problems/min-stack)  |  [最小栈](/solution/100-199/0155.min-stack/)  |  `栈`,`设计`  |  <font color=green>简单</font>  |
 |  [157](https://leetcode-cn.com/problems/read-n-characters-given-read4)  |  [用 read4 读取 n 个字符](/solution/100-199/0157.read-n-characters-given-read4/)  |  `字符串`  |  <font color=green>简单</font>  |
@@ -127,7 +127,7 @@
 |  [441](https://leetcode-cn.com/problems/arranging-coins)  |  [排列硬币](/solution/400-499/0441.arranging-coins/)  |  `数学`,`二分查找`  |  <font color=green>简单</font>  |
 |  [443](https://leetcode-cn.com/problems/string-compression)  |  [压缩字符串](/solution/400-499/0443.string-compression/)  |  `字符串`  |  <font color=green>简单</font>  |
 |  [447](https://leetcode-cn.com/problems/number-of-boomerangs)  |  [回旋镖的数量](/solution/400-499/0447.number-of-boomerangs/)  |  `哈希表`  |  <font color=green>简单</font>  |
-|  [448](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array)  |  [找到所有数组中消失的数字](/solution/400-499/0448.find-all-numbers-disappeared-in-an-array/)  |  `数组`  |  <font color=green>简单</font>  |
+|  [448](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array)  |  [找到所有数组中消失的数字](/solution/400-499/0448.find-all-numbers-disappeared-in-an-array/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [453](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements)  |  [最小移动次数使数组元素相等](/solution/400-499/0453.minimum-moves-to-equal-array-elements/)  |  `数学`  |  <font color=green>简单</font>  |
 |  [455](https://leetcode-cn.com/problems/assign-cookies)  |  [分发饼干](/solution/400-499/0455.assign-cookies/)  |  `贪心算法`  |  <font color=green>简单</font>  |
 |  [459](https://leetcode-cn.com/problems/repeated-substring-pattern)  |  [重复的子字符串](/solution/400-499/0459.repeated-substring-pattern/)  |  `字符串`  |  <font color=green>简单</font>  |

solution/100-199/0136.single-number/README.md

@@ -0,0 +1,48 @@
+# [136. 只出现一次的数字](https://leetcode-cn.com/problems/single-number/description/)
+
+### 题目描述
+
+<p>给定一个<strong>非空</strong>整数数组，除了某个元素只出现一次以外，其余每个元素均出现两次。找出那个只出现了一次的元素。</p>
+
+<p><strong>说明：</strong></p>
+
+<p>你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗？</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入:</strong> [2,2,1]
+<strong>输出:</strong> 1
+</pre>
+
+<p><strong>示例&nbsp;2:</strong></p>
+
+<pre><strong>输入:</strong> [4,1,2,1,2]
+<strong>输出:</strong> 4</pre>
+
+### 解题思路
+
+1. hash table
+
+### 具体解法
+
+#### **Golang**
+```go
+func singleNumber(nums []int) int {
+	numMap := make(map[int]bool)
+	for _, v := range nums {
+		if _, ok := numMap[v]; ok {
+			numMap[v] = false
+		} else {
+			numMap[v] = true
+		}
+	}
+	for _, v := range nums {
+		if numMap[v] == true {
+			return v
+		}
+	}
+	return 0
+}
+```
+
+

solution/100-199/0136.single-number/solution.go

@@ -0,0 +1,27 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=136 lang=golang
+ *
+ * [136] 只出现一次的数字
+ */
+
+// @lc code=start
+func singleNumber(nums []int) int {
+	numMap := make(map[int]bool)
+	for _, v := range nums {
+		if _, ok := numMap[v]; ok {
+			numMap[v] = false
+		} else {
+			numMap[v] = true
+		}
+	}
+	for _, v := range nums {
+		if numMap[v] == true {
+			return v
+		}
+	}
+	return 0
+}
+
+// @lc code=end

solution/100-199/0136.single-number/solution_test.go

@@ -0,0 +1,21 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestSingleNumber(t *testing.T) {
+	var ret int
+	var nums []int
+	ret = 1
+	nums = []int{2, 2, 1}
+	if ret != singleNumber(nums) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+
+	ret = 4
+	nums = []int{4, 1, 2, 1, 2}
+	if ret != singleNumber(nums) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+}

solution/100-199/_sidebar.md

@@ -42,7 +42,7 @@
     - [133. 克隆图](solution/100-199/0133.clone-graph/)
     - [134. 加油站](solution/100-199/0134.gas-station/)
     - [135. 分发糖果](solution/100-199/0135.candy/)
-    - [136. 只出现一次的数字](solution/100-199/0136.single-number/)
+    - [136. 只出现一次的数字 ✅](solution/100-199/0136.single-number/)
     - [137. 只出现一次的数字 ii](solution/100-199/0137.single-number-ii/)
     - [138. 复制带随机指针的链表](solution/100-199/0138.copy-list-with-random-pointer/)
     - [139. 单词拆分](solution/100-199/0139.word-break/)