feat: commit solution 35

Author: lxlxw

_sidebar.md

@@ -17,6 +17,7 @@
   - [26.删除排序数组中的重复项 ✅](solution/1-99/0026.remove-duplicates-from-sorted-array/)
   - [27.移除元素 ✅](solution/1-99/0027.remove-element/)
   - [28.实现 strStr() ✅](solution/1-99/0028.implement-strstr/)
+  - [35.搜索插入位置 ✅](solution/1-99/0035.search-insert-position/)
   - [88.合并两个有序数组](solution/1-99/0088.merge-sorted-array/)
   - [125.验证回文串 ✅](solution/100-199/0125.valid-palindrome/)
 

index-tags.md

@@ -26,6 +26,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>  |✅ |
+|  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [88](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/1-99/0088.merge-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 
 #### **哈希表**
@@ -58,6 +59,12 @@
 | --- | --- | --- | --- | --- |
 |  [21](https://leetcode-cn.com/problems/merge-two-sorted-lists)  |  [合并两个有序链表](/solution/1-99/0021.merge-two-sorted-lists/)  |  `链表`  |  <font color=green>简单</font>  |✅ |
 
+#### **二分查找**
+
+|  题号  |  题解  |  标签  | 难度  | 是否解题 |
+| --- | --- | --- | --- | --- |
+|  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
+
 #### **排序**
 
 #### **队列**
@@ -66,8 +73,6 @@
 
 #### **树**
 
-#### **二分查找**
-
 #### **递归**
 
 #### **深度优先搜素**

index-type.md

@@ -17,7 +17,7 @@
 |  [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>  |✅ |
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
-|  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |
+|  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [38](https://leetcode-cn.com/problems/count-and-say)  |  [外观数列](/solution/1-99/0038.count-and-say/)  |  `字符串`  |  <font color=green>简单</font>  |
 |  [53](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/1-99/0053.maximum-subarray/)  |  `数组`,`分治算法`,`动态规划`  |  <font color=green>简单</font>  |
 |  [58](https://leetcode-cn.com/problems/length-of-last-word)  |  [最后一个单词的长度](/solution/1-99/0058.length-of-last-word/)  |  `字符串`  |  <font color=green>简单</font>  |

solution/1-99/0035.search-insert-position/README.md

@@ -0,0 +1,64 @@
+# [35.搜索插入位置](https://leetcode-cn.com/problems/search-insert-position/)
+
+
+### 题目描述
+
+<div class="notranslate"><p>给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。</p>
+
+<p>你可以假设数组中无重复元素。</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 5
+<strong>输出:</strong> 2
+</pre>
+
+<p><strong>示例&nbsp;2:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 2
+<strong>输出:</strong> 1
+</pre>
+
+<p><strong>示例 3:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 7
+<strong>输出:</strong> 4
+</pre>
+
+<p><strong>示例 4:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 0
+<strong>输出:</strong> 0
+</pre>
+</div>
+
+
+### 解题思路
+
+![](http://lc-photo.xwlin.com/35.png)
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+func searchInsert(nums []int, target int) int {
+	left := 0
+	right := len(nums) - 1
+	for left <= right {
+		mid := (left + right) / 2
+		if nums[mid] == target {
+			return mid
+		} else if nums[mid] > target {
+			right = mid - 1
+		} else {
+			left = mid + 1
+		}
+	}
+	return left
+}
+```
+
+
+<!-- tabs:end -->

solution/1-99/0035.search-insert-position/solution.go

@@ -0,0 +1,27 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=35 lang=golang
+ *
+ * [35] 搜索插入位置
+ */
+
+// @lc code=start
+
+func searchInsert(nums []int, target int) int {
+	left := 0
+	right := len(nums) - 1
+	for left <= right {
+		mid := (left + right) / 2
+		if nums[mid] == target {
+			return mid
+		} else if nums[mid] > target {
+			right = mid - 1
+		} else {
+			left = mid + 1
+		}
+	}
+	return left
+}
+
+// @lc code=end

solution/1-99/0035.search-insert-position/solution_test.go

@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestSearchInsert(t *testing.T) {
+	var nums []int
+	var target int
+	var ret int
+
+	nums = []int{1, 3}
+	target = 2
+	ret = 1
+	if ret != searchInsert(nums, target) {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	nums = []int{1, 3, 5, 6}
+	target = 5
+	ret = 2
+	if ret != searchInsert(nums, target) {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	nums = []int{1, 3, 5, 6}
+	target = 2
+	ret = 1
+	if ret != searchInsert(nums, target) {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	nums = []int{1, 3, 5, 6}
+	target = 7
+	ret = 4
+	if ret != searchInsert(nums, target) {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	nums = []int{1, 3, 5, 6}
+	target = 0
+	ret = 0
+	if ret != searchInsert(nums, target) {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+}