From 88ca946a7dd25e78eb50730a1285476691152337 Mon Sep 17 00:00:00 2001
From: KingArthur0205 <gpan20020205@gmail.com>
Date: Tue, 22 Aug 2023 15:00:45 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200034.=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.md=20C=E8=AF=AD?=
 =?UTF-8?q?=E8=A8=80=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md b/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
index e5266cd9..b4128166 100644
--- a/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
+++ b/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
@@ -739,6 +739,60 @@ class Solution {
 }
 ```
 
+### C
+```c
+int searchLeftBorder(int *nums, int numsSize, int target) {
+    int left = 0, right = numsSize - 1;
+    // 记录leftBorder没有被赋值的情况
+    int leftBorder = -1;
+    // 边界为[left, right]
+    while (left <= right) {
+        // 更新middle值，等同于middle = (left + right) / 2
+        int middle = left + ((right - left) >> 1);
+        // 若当前middle所指为target，将左边界设为middle，并向左继续寻找左边界
+        if (nums[middle] == target) {
+            leftBorder = middle;
+            right = middle - 1;
+        } else if (nums[middle] > target) {
+            right = middle - 1;
+        } else {
+            left = middle + 1;
+        }
+    }
+    return leftBorder;
+}
+int searchRightBorder(int *nums, int numsSize, int target) {
+    int left = 0, right = numsSize - 1;
+    // 记录rightBorder没有被赋值的情况
+    int rightBorder = -1;
+    while (left <= right) {
+        int middle = left + ((right - left) >> 1);
+        // 若当前middle所指为target，将右边界设为middle，并向右继续寻找右边界
+        if (nums[middle] == target) {
+            rightBorder = middle;
+            left = middle + 1;
+        } else if (nums[middle] > target) {
+            right = middle - 1;
+        } else {
+            left = middle + 1;
+        }
+    }
+    return rightBorder;
+}
+
+int* searchRange(int* nums, int numsSize, int target, int* returnSize){
+    int leftBorder = searchLeftBorder(nums, numsSize, target);
+    int rightBorder = searchRightBorder(nums, numsSize, target);
+
+    // 定义返回数组及数组大小
+    *returnSize = 2;
+    int *resNums = (int*)malloc(sizeof(int) * 2);
+    resNums[0] = leftBorder;
+    resNums[1] = rightBorder;
+    return resNums;
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>