From ca628323d60513178ba19e192d6bbfae94c2e947 Mon Sep 17 00:00:00 2001
From: KieranTou <qydou7@gmail.com>
Date: Fri, 17 Feb 2023 10:00:34 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=AD=A3=E6=8E=92=E7=89=88=E9=94=99?=
 =?UTF-8?q?=E8=AF=AF=20=E4=BC=98=E5=8C=96=E4=BB=A3=E7=A0=81=E6=9B=B4?=
 =?UTF-8?q?=E6=98=93=E7=90=86=E8=A7=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0035.搜索插入位置.md | 28 ++++++++++++++--------------
 1 file changed, 14 insertions(+), 14 deletions(-)

diff --git a/problems/0035.搜索插入位置.md b/problems/0035.搜索插入位置.md
index dd15b36b..4d9ee74f 100644
--- a/problems/0035.搜索插入位置.md
+++ b/problems/0035.搜索插入位置.md
@@ -250,23 +250,23 @@ public int searchInsert(int[] nums, int target) {
 
 
 
-Golang:
+### Golang
 
-```golang
+```go
 // 第一种二分法
 func searchInsert(nums []int, target int) int {
-    l, r := 0, len(nums) - 1
-    for l <= r{
-        m := l + (r - l)/2
-        if nums[m] == target{
-            return m
-        }else if nums[m] > target{
-            r = m - 1
-        }else{
-            l = m + 1
-        }
-    }
-    return r + 1
+	left, right := 0, len(nums)-1
+	for left <= right {
+		mid := left + (right-left)/2
+		if nums[mid] == target {
+			return mid
+		} else if nums[mid] > target {
+			right = mid - 1
+		} else {
+			left = mid + 1
+		}
+	}
+	return len(nums)
 }
 ```