From 25a330fcdbc4b2e6958efa51143ce31f476dc60a Mon Sep 17 00:00:00 2001
From: cherrypicker <cherrypicker404@gmail.com>
Date: Thu, 21 Dec 2023 15:29:18 +0800
Subject: [PATCH 1/2] =?UTF-8?q?Update0704.=E4=BA=8C=E5=88=86=E6=9F=A5?=
 =?UTF-8?q?=E6=89=BE=20Go=E7=A4=BA=E4=BE=8B=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加注释、计算区间中点mid时使用位运算代替除法运算
---
 problems/0704.二分查找.md | 72 ++++++++++++++++++++++-------------
 1 file changed, 46 insertions(+), 26 deletions(-)

diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md
index 590ec1b1..c3783aa3 100644
--- a/problems/0704.二分查找.md
+++ b/problems/0704.二分查找.md
@@ -251,40 +251,60 @@ class Solution:
 （版本一）左闭右闭区间
 
 ```go
+// 时间复杂度 O(logn)
 func search(nums []int, target int) int {
-    high := len(nums)-1
-    low := 0
-    for low <= high {
-        mid := low + (high-low)/2
-        if nums[mid] == target {
-            return mid
-        } else if nums[mid] > target {
-            high = mid-1
-        } else {
-            low = mid+1
-        }
-    }
-    return -1
+	// 初始化左右边界
+	left := 0
+	right := len(nums) - 1
+
+	// 循环逐步缩小区间范围
+	for left <= right {
+		// 求区间中点
+		mid := left + (right-left)>>1
+
+		// 根据 nums[mid] 和 target 的大小关系
+		// 调整区间范围
+		if nums[mid] == target {
+			return mid
+		} else if nums[mid] < target {
+			left = mid + 1
+		} else {
+			right = mid - 1
+		}
+	}
+
+	// 在输入数组内没有找到值等于 target 的元素
+	return -1
 }
 ```
 
 （版本二）左闭右开区间
 
 ```go
+// 时间复杂度 O(logn)
 func search(nums []int, target int) int {
-    high := len(nums)
-    low := 0
-    for low < high {
-        mid := low + (high-low)/2
-        if nums[mid] == target {
-            return mid
-        } else if nums[mid] > target {
-            high = mid
-        } else {
-            low = mid+1
-        }
-    }
-    return -1
+	// 初始化左右边界
+	left := 0
+	right := len(nums)
+
+	// 循环逐步缩小区间范围
+	for left < right {
+		// 求区间中点
+		mid := left + (right-left)>>1
+
+		// 根据 nums[mid] 和 target 的大小关系
+		// 调整区间范围
+		if nums[mid] == target {
+			return mid
+		} else if nums[mid] < target {
+			left = mid + 1
+		} else {
+			right = mid
+		}
+	}
+
+	// 在输入数组内没有找到值等于 target 的元素
+	return -1
 }
 ```
 

From 4516aaab6096e84f5fd7b526a135225c1b862570 Mon Sep 17 00:00:00 2001
From: cherrypicker <cherrypicker404@gmail.com>
Date: Thu, 21 Dec 2023 15:36:44 +0800
Subject: [PATCH 2/2] =?UTF-8?q?Update0027.=E7=A7=BB=E9=99=A4=E5=85=83?=
 =?UTF-8?q?=E7=B4=A0=20Go=E7=A4=BA=E4=BE=8B=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加注释、代码格式化
---
 problems/0027.移除元素.md | 27 +++++++++++++++++----------
 1 file changed, 17 insertions(+), 10 deletions(-)

diff --git a/problems/0027.移除元素.md b/problems/0027.移除元素.md
index 8522e785..dbde3d19 100644
--- a/problems/0027.移除元素.md
+++ b/problems/0027.移除元素.md
@@ -256,17 +256,24 @@ class Solution:
 ### Go：
 
 ```go
+// 快慢指针法
+// 时间复杂度 O(n)
+// 空间复杂度 O(1)
 func removeElement(nums []int, val int) int {
-    length:=len(nums)
-    res:=0
-    for i:=0;i<length;i++{
-        if nums[i]!=val {
-            nums[res]=nums[i]
-            res++
-        }
-    }
-    nums=nums[:res]
-    return res
+	// 初始化慢指针 slow
+	slow := 0
+	// 通过 for 循环移动快指针 fast
+	// 当 fast 指向的元素等于 val 时，跳过
+	// 否则，将该元素写入 slow 指向的位置，并将 slow 后移一位
+	for fast := 0; fast < len(nums); fast++ {
+		if nums[fast] == val {
+			continue
+		}
+		nums[slow] = nums[fast]
+		slow++
+	}
+
+	return slow
 }
 ```
 ```go