feat: commit solution

Author: lxlxw

_sidebar.md

@@ -16,6 +16,10 @@
   - [21.合并两个有序链表 ✅](solution/1-99/0021.merge-two-sorted-lists/)
   - [26.删除排序数组中的重复项 ✅](solution/1-99/0026.remove-duplicates-from-sorted-array/)
   - [27.移除元素 ✅](solution/1-99/0027.remove-element/)
+  - [88.合并两个有序数组](solution/1-99/0088.merge-sorted-array/)
+  - [125.验证回文串 ✅](solution/100-199/0125.valid-palindrome/)
+
+
 
 
 

index-tags.md

@@ -16,6 +16,7 @@
 | --- | --- | --- | --- | --- |
 |  [13](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/1-99/0013.roman-to-integer/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [20](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/1-99/0020.valid-parentheses/)  |  `栈`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 
 #### **数组**
 
@@ -24,6 +25,7 @@
 |  [1](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/1-99/0001.two-sum/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  | ✅ |
 |  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [27](https://leetcode-cn.com/problems/remove-element)  |  [移除元素](/solution/1-99/0027.remove-element/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
+|  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 
 #### **哈希表**
 
@@ -61,6 +63,8 @@
 | --- | --- | --- | --- | --- |
 |  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [27](https://leetcode-cn.com/problems/remove-element)  |  [移除元素](/solution/1-99/0027.remove-element/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
+|  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
+|  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 
 #### **递归**
 

index-type.md

@@ -26,7 +26,7 @@
 |  [69](https://leetcode-cn.com/problems/sqrtx)  |  [x 的平方根](/solution/1-99/0069.sqrt%28x%29/)  |  `数学`,`二分查找`  |  <font color=green>简单</font>  |
 |  [70](https://leetcode-cn.com/problems/climbing-stairs)  |  [爬楼梯](/solution/1-99/0070.climbing-stairs/)  |  `动态规划`  |  <font color=green>简单</font>  |
 |  [83](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list)  |  [删除排序链表中的重复元素](/solution/1-99/0083.remove-duplicates-from-sorted-list/)  |  `链表`  |  <font color=green>简单</font>  |
-|  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |
+|  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [100](https://leetcode-cn.com/problems/same-tree)  |  [相同的树](/solution/100-199/0100.same-tree/)  |  `树`,`深度优先搜索`  |  <font color=green>简单</font>  |
 |  [101](https://leetcode-cn.com/problems/symmetric-tree)  |  [对称二叉树](/solution/100-199/0101.symmetric-tree/)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  <font color=green>简单</font>  |
 |  [104](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree)  |  [二叉树的最大深度](/solution/100-199/0104.maximum-depth-of-binary-tree/)  |  `树`,`深度优先搜索`  |  <font color=green>简单</font>  |
@@ -39,7 +39,7 @@
 |  [119](https://leetcode-cn.com/problems/pascals-triangle-ii)  |  [杨辉三角 ii](/solution/100-199/0119.pascal%27s-triangle-ii/)  |  `数组`  |  <font color=green>简单</font>  |
 |  [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>  |
+|  [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>  |
 |  [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>  |

solution/1-99/0088.merge-sorted-array/README.md

@@ -0,0 +1,63 @@
+# [88.合并两个有序数组](https://leetcode-cn.com/problems/merge-sorted-array)
+
+
+### 题目描述
+
+<div class="notranslate"><p>给你两个有序整数数组&nbsp;<em>nums1 </em>和 <em>nums2</em>，请你将 <em>nums2 </em>合并到&nbsp;<em>nums1&nbsp;</em>中<em>，</em>使 <em>nums1 </em>成为一个有序数组。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>说明:</strong></p>
+
+<ul>
+	<li>初始化&nbsp;<em>nums1</em> 和 <em>nums2</em> 的元素数量分别为&nbsp;<em>m</em> 和 <em>n </em>。</li>
+	<li>你可以假设&nbsp;<em>nums1&nbsp;</em>有足够的空间（空间大小大于或等于&nbsp;<em>m + n</em>）来保存 <em>nums2</em> 中的元素。</li>
+</ul>
+
+<p>&nbsp;</p>
+
+<p><strong>示例:</strong></p>
+
+<pre><strong>输入:</strong>
+nums1 = [1,2,3,0,0,0], m = 3
+nums2 = [2,5,6],       n = 3
+
+<strong>输出:</strong>&nbsp;[1,2,2,3,5,6]</pre>
+</div>
+
+### 解题思路
+
+1. 采用双指针分别将两个数组 `nums1` 和数组 `nums2` 从后向前插入到数组 `nums1` 中
+2. 指针 `i` 标记数组 nums1 当前比较位置，开始位数组元素最后位
+3. 指针 `j` 标记数组 nums2 当前比较位置，开始位数组元素最后位
+4. 指针 `k` 表示结果从后向前当前可插入位置，默认 `nums1` 后 `n` 位都是可插入位，将 `nums1` 中元素插入当前可插入位后， 从 指针 `i` 至 `k` 都是可插入位
+5. 循环将数组 `nums2` 插入到数组 `nums1`
+6. 当数组 `nums1` 当前可比较数据位 `i` 大于等于 0 并且数组 `nums1` 当前位置值比 `nums2` 当前位置值大时，将数组 `nums1` 当前位置数组 插入到 `k` 位置 ，`i` 位指针向前挪一位
+7. 否则将 `nums2` 当前位置数据插入到 `k` 位置，`j` 位指针向前挪一位
+8. 插入完成后将当前插入位置指针 `k` 向前挪一位，进行下一次插入
+
+![](http://lc-photo.xwlin.com/88.png)
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+func merge(nums1 []int, m int, nums2 []int, n int) {
+	var i, j = m - 1, n - 1
+
+	for k := m + n - 1; k >= 0; k-- {
+		if j < 0 || (i >= 0 && nums1[i] > nums2[j]) {
+			nums1[k] = nums1[i]
+			i--
+		} else {
+			nums1[k] = nums2[j]
+			j--
+		}
+	}
+}
+```
+
+
+<!-- tabs:end -->

solution/1-99/0088.merge-sorted-array/solution.go

@@ -0,0 +1,22 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=88 lang=golang
+ *
+ * [88] 合并两个有序数组
+ */
+func merge(nums1 []int, m int, nums2 []int, n int) {
+	var i, j = m - 1, n - 1
+
+	for k := m + n - 1; k >= 0; k-- {
+		if j < 0 || (i >= 0 && nums1[i] > nums2[j]) {
+			nums1[k] = nums1[i]
+			i--
+		} else {
+			nums1[k] = nums2[j]
+			j--
+		}
+	}
+}
+
+// @lc code=end

solution/1-99/0088.merge-sorted-array/solution_test.go

@@ -0,0 +1,18 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestMerge(t *testing.T) {
+	m, n := 3, 3
+	nums1 := []int{1, 2, 3, 0, 0, 0}
+	nums2 := []int{2, 5, 6}
+	ret := []int{1, 2, 2, 3, 5, 6}
+	merge(nums1, m, nums2, n)
+	for k, v := range ret {
+		if nums1[k] != v {
+			t.Fatalf("case fails: %v\n", nums1)
+		}
+	}
+}

solution/100-199/0125.valid-palindrome/README.md

@@ -0,0 +1,61 @@
+# [125.验证回文串](https://leetcode-cn.com/problems/valid-palindrome)
+
+
+### 题目描述
+
+<div class="notranslate"><p>给定一个字符串，验证它是否是回文串，只考虑字母和数字字符，可以忽略字母的大小写。</p>
+
+<p><strong>说明：</strong>本题中，我们将空字符串定义为有效的回文串。</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入:</strong> "A man, a plan, a canal: Panama"
+<strong>输出:</strong> true
+</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre><strong>输入:</strong> "race a car"
+<strong>输出:</strong> false
+</pre>
+</div>
+
+### 解题思路
+
+![](http://lc-photo.xwlin.com/125.png)
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+import (
+	"strings"
+)
+
+func isPalindrome(s string) bool {
+	s = strings.ToLower(s)
+	l, r := 0, len(s)-1
+	for l < r {
+		for l < r && (s[l] < 'a' || s[l] > 'z') && (s[l] < '0' || s[l] > '9') {
+			l++
+		}
+		for l < r && (s[r] < 'a' || s[r] > 'z') && (s[r] < '0' || s[r] > '9') {
+			r--
+		}
+		if l < r {
+			if s[l] != s[r] {
+				return false
+			}
+			l++
+			r--
+		}
+	}
+	return true
+}
+```
+
+
+<!-- tabs:end -->

solution/100-199/0125.valid-palindrome/solution.go

@@ -0,0 +1,35 @@
+package leetcode
+
+import (
+	"strings"
+)
+
+/*
+ * @lc app=leetcode.cn id=125 lang=golang
+ *
+ * [125] 验证回文串
+ */
+
+// @lc code=start
+func isPalindrome(s string) bool {
+	s = strings.ToLower(s)
+	l, r := 0, len(s)-1
+	for l < r {
+		for l < r && (s[l] < 'a' || s[l] > 'z') && (s[l] < '0' || s[l] > '9') {
+			l++
+		}
+		for l < r && (s[r] < 'a' || s[r] > 'z') && (s[r] < '0' || s[r] > '9') {
+			r--
+		}
+		if l < r {
+			if s[l] != s[r] {
+				return false
+			}
+			l++
+			r--
+		}
+	}
+	return true
+}
+
+// @lc code=end

solution/100-199/0125.valid-palindrome/solution_test.go

@@ -0,0 +1,47 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+func TestIsPalindrome(t *testing.T) {
+
+	var x string
+	var ret bool
+
+	ret = false
+	x = "race a car"
+	fmt.Printf("x = %v ret = %v\n", x, isPalindrome(x))
+	if isPalindrome(x) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	ret = true
+	x = ".,"
+	fmt.Printf("x = %v ret = %v\n", x, isPalindrome(x))
+	if isPalindrome(x) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	ret = true
+	x = "A man, a plan, a canal: Panama"
+	fmt.Printf("x = %v ret = %v\n", x, isPalindrome(x))
+	if isPalindrome(x) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	ret = true
+	x = "......a....."
+	fmt.Printf("x = %v ret = %v\n", x, isPalindrome(x))
+	if isPalindrome(x) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	ret = false
+	x = "a.b,."
+	fmt.Printf("x = %v ret = %v\n", x, isPalindrome(x))
+	if isPalindrome(x) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+}