From b3711266156c2b8e25ac6e40b681842fefab9279 Mon Sep 17 00:00:00 2001
From: HanMengnan <1448189829@qq.com>
Date: Tue, 11 Jan 2022 12:48:46 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=2034.=20=E5=9C=A8=E6=8E=92?=
 =?UTF-8?q?=E5=BA=8F=E6=95=B0=E7=BB=84=E4=B8=AD=E6=9F=A5=E6=89=BE=E5=85=83?=
 =?UTF-8?q?=E7=B4=A0=E7=9A=84=E7=AC=AC=E4=B8=80=E4=B8=AA=E5=92=8C=E6=9C=80?=
 =?UTF-8?q?=E5=90=8E=E4=B8=80=E4=B8=AA=E4=BD=8D=E7=BD=AE=20Go=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...元素的第一个和最后一个位置.md | 48 +++++++++++++++++++
 1 file changed, 48 insertions(+)

diff --git a/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md b/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
index 2b96e41b..3f9cd747 100644
--- a/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
+++ b/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
@@ -389,6 +389,54 @@ class Solution:
 ### Go
 
 ```go
+func searchRange(nums []int, target int) []int {
+	leftBorder := searchLeftBorder(nums, target)
+	rightBorder := searchRightBorder(nums, target)
+
+	if leftBorder == -2 || rightBorder == -2 { // 情况一
+		return []int{-1, -1}
+	} else if rightBorder-leftBorder > 1 { // 情况三
+		return []int{leftBorder + 1, rightBorder - 1}
+	} else { // 情况二
+		return []int{-1, -1}
+	}
+}
+
+func searchLeftBorder(nums []int, target int) int {
+	left, right := 0, len(nums)-1
+	leftBorder := -2 // 记录一下leftBorder没有被赋值的情况
+	for left <= right {
+		middle := (left + right) / 2
+		if target == nums[middle] {
+			right = middle - 1
+			// 左边界leftBorder更新
+			leftBorder = right
+		} else if target > nums[middle] {
+			left = middle + 1
+		} else {
+			right = middle - 1
+		}
+	}
+	return leftBorder
+}
+
+func searchRightBorder(nums []int, target int) int {
+	left, right := 0, len(nums)-1
+	rightBorder := -2 // 记录一下rightBorder没有被赋值的情况
+	for left <= right {
+		middle := (left + right) / 2
+		if target == nums[middle] {
+			left = middle + 1
+			// 右边界rightBorder更新
+			rightBorder = left
+		} else if target > nums[middle] {
+			left = middle + 1
+		} else {
+			right = middle - 1
+		}
+	}
+	return rightBorder
+}
 ```
 
 ### JavaScript