commit solution 344 345

Author: lxlxw

_sidebar.md

@@ -349,8 +349,8 @@
   - [341. 扁平化嵌套列表迭代器](solution/300-399/0341.flatten-nested-list-iterator/)
   - [342. 4的幂](solution/300-399/0342.power-of-four/)
   - [343. 整数拆分](solution/300-399/0343.integer-break/)
-  - [344. 反转字符串](solution/300-399/0344.reverse-string/)
-  - [345. 反转字符串中的元音字母](solution/300-399/0345.reverse-vowels-of-a-string/)
+  - [344. 反转字符串 ✅](solution/300-399/0344.reverse-string/)
+  - [345. 反转字符串中的元音字母 ✅](solution/300-399/0345.reverse-vowels-of-a-string/)
   - [346. 数据流中的移动平均值](solution/300-399/0346.moving-average-from-data-stream/)
   - [347. 前 k 个高频元素](solution/300-399/0347.top-k-frequent-elements/)
   - [348. 判定井字棋胜负](solution/300-399/0348.design-tic-tac-toe/)

index-tags.md

@@ -30,6 +30,8 @@
 |  [20](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/1-99/0020.valid-parentheses/)  |  `栈`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/300-399/0344.reverse-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/300-399/0345.reverse-vowels-of-a-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 
 #### **数学**
 
@@ -68,7 +70,8 @@
 |  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 ii - 输入有序数组](/solution/100-199/0167.two-sum-ii---input-array-is-sorted/)  |  `数组`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
-
+|  [344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/300-399/0344.reverse-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/300-399/0345.reverse-vowels-of-a-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 
 #### **链表**
 

index-type.md

@@ -100,8 +100,8 @@
 |  [326](https://leetcode-cn.com/problems/power-of-three)  |  [3的幂](/solution/300-399/0326.power-of-three/)  |  `数学`  |  <font color=green>简单</font>  |
 |  [339](https://leetcode-cn.com/problems/nested-list-weight-sum)  |  [嵌套列表权重和](/solution/300-399/0339.nested-list-weight-sum/)  |  `深度优先搜索`  |  <font color=green>简单</font>  |
 |  [342](https://leetcode-cn.com/problems/power-of-four)  |  [4的幂](/solution/300-399/0342.power-of-four/)  |  `位运算`  |  <font color=green>简单</font>  |
-|  [344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/300-399/0344.reverse-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |
-|  [345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/300-399/0345.reverse-vowels-of-a-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |
+|  [344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/300-399/0344.reverse-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/300-399/0345.reverse-vowels-of-a-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [346](https://leetcode-cn.com/problems/moving-average-from-data-stream)  |  [数据流中的移动平均值](/solution/300-399/0346.moving-average-from-data-stream/)  |  `设计`,`队列`  |  <font color=green>简单</font>  |
 |  [349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/300-399/0349.intersection-of-two-arrays/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |
 |  [350](https://leetcode-cn.com/problems/intersection-of-two-arrays-ii)  |  [两个数组的交集 ii](/solution/300-399/0350.intersection-of-two-arrays-ii/)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  <font color=green>简单</font>  |

solution/200-299/0268.missing-number/solution.go

@@ -9,7 +9,7 @@ package leetcode
 // @lc code=start
 func missingNumber(nums []int) int {
 	sum1, sum2 := len(nums), 0
-	for i, _ := range nums {
+	for i := range nums {
 		sum1 += i
 		sum2 += nums[i]
 	}

solution/300-399/0344.reverse-string/README.md

@@ -0,0 +1,46 @@
+# [344. 反转字符串](https://leetcode-cn.com/problems/reverse-string/description/)
+
+
+### 题目描述
+
+<p>编写一个函数，其作用是将输入的字符串反转过来。输入字符串以字符数组 <code>char[]</code> 的形式给出。</p>
+
+<p>不要给另外的数组分配额外的空间，你必须<strong><a href="https://baike.baidu.com/item/原地算法" target="_blank">原地</a>修改输入数组</strong>、使用 O(1) 的额外空间解决这一问题。</p>
+
+<p>你可以假设数组中的所有字符都是 <a href="https://baike.baidu.com/item/ASCII" target="_blank">ASCII</a> 码表中的可打印字符。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>[&quot;h&quot;,&quot;e&quot;,&quot;l&quot;,&quot;l&quot;,&quot;o&quot;]
+<strong>输出：</strong>[&quot;o&quot;,&quot;l&quot;,&quot;l&quot;,&quot;e&quot;,&quot;h&quot;]
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>[&quot;H&quot;,&quot;a&quot;,&quot;n&quot;,&quot;n&quot;,&quot;a&quot;,&quot;h&quot;]
+<strong>输出：</strong>[&quot;h&quot;,&quot;a&quot;,&quot;n&quot;,&quot;n&quot;,&quot;a&quot;,&quot;H&quot;]</pre>
+
+### 解题思路
+
+1. 双指针操作
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+func reverseString(s []byte) {
+	p, q := 0, len(s)-1
+	for p < q {
+		s[p], s[q] = s[q], s[p]
+		p++
+		q--
+	}
+}
+```
+
+
+<!-- tabs:end -->

solution/300-399/0344.reverse-string/solution.go

@@ -0,0 +1,19 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=344 lang=golang
+ *
+ * [344] 反转字符串
+ */
+
+// @lc code=start
+func reverseString(s []byte) {
+	p, q := 0, len(s)-1
+	for p < q {
+		s[p], s[q] = s[q], s[p]
+		p++
+		q--
+	}
+}
+
+// @lc code=end

solution/300-399/0344.reverse-string/solution_test.go

@@ -0,0 +1,19 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestReverseString(t *testing.T) {
+	var ret []byte
+	var s []byte
+
+	s = []byte("hello")
+	ret = []byte("olleh")
+	reverseString(s)
+	for i, v := range s {
+		if v != ret[i] {
+			t.Fatalf("case fails %v\n", ret)
+		}
+	}
+}

solution/300-399/0345.reverse-vowels-of-a-string/README.md

@@ -0,0 +1,62 @@
+# [345. 反转字符串中的元音字母](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)
+
+
+### 题目描述
+
+<p>编写一个函数，以字符串作为输入，反转该字符串中的元音字母。</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入: </strong>&quot;hello&quot;
+<strong>输出: </strong>&quot;holle&quot;
+</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre><strong>输入: </strong>&quot;leetcode&quot;
+<strong>输出: </strong>&quot;leotcede&quot;</pre>
+
+<p><strong>说明:</strong><br>
+元音字母不包含字母&quot;y&quot;。</p>
+
+### 解题思路
+
+1. 双指针操作
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+func reverseVowels(s string) string {
+	vowel := map[rune]bool{
+		'a': true,
+		'e': true,
+		'i': true,
+		'o': true,
+		'u': true,
+	}
+	p, q := 0, len(s)-1
+	ret := []byte(s)
+	for p < q {
+		_, ok1 := vowel[unicode.ToLower(rune(ret[p]))]
+		if !ok1 {
+			p++
+		}
+		_, ok2 := vowel[unicode.ToLower(rune(ret[q]))]
+		if !ok2 {
+			q--
+		}
+		if ok1 && ok2 {
+			ret[p], ret[q] = ret[q], ret[p]
+			p++
+			q--
+		}
+	}
+	return string(ret)
+}
+```
+
+
+<!-- tabs:end -->

solution/300-399/0345.reverse-vowels-of-a-string/solution.go

@@ -0,0 +1,40 @@
+package leetcode
+
+import "unicode"
+
+/*
+ * @lc app=leetcode.cn id=345 lang=golang
+ *
+ * [345] 反转字符串中的元音字母
+ */
+
+// @lc code=start
+func reverseVowels(s string) string {
+	vowel := map[rune]bool{
+		'a': true,
+		'e': true,
+		'i': true,
+		'o': true,
+		'u': true,
+	}
+	p, q := 0, len(s)-1
+	ret := []byte(s)
+	for p < q {
+		_, ok1 := vowel[unicode.ToLower(rune(ret[p]))]
+		if !ok1 {
+			p++
+		}
+		_, ok2 := vowel[unicode.ToLower(rune(ret[q]))]
+		if !ok2 {
+			q--
+		}
+		if ok1 && ok2 {
+			ret[p], ret[q] = ret[q], ret[p]
+			p++
+			q--
+		}
+	}
+	return string(ret)
+}
+
+// @lc code=end

solution/300-399/0345.reverse-vowels-of-a-string/solution_test.go

@@ -0,0 +1,17 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestReverseVowels(t *testing.T) {
+	var ret string
+	var s string
+
+	s = "hello"
+	ret = "holle"
+	if ret != reverseVowels(s) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+
+}