algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 07:35:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2519 from awsome-knowledge/master

Browse Source 
fix: 纠正 target 的拼写
This commit is contained in:
程序员Carl
2024-04-10 10:38:01 +08:00
committed by GitHub
parent 0cdf537370 41bc5e4afb
commit deea6b0919
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
View File

@ -233,7 +233,7 @@ class Solution {
if (index == -1) { // nums 中不存在 target，直接返回 {-1, -1} if (index == -1) { // nums 中不存在 target，直接返回 {-1, -1}
return new int[] {-1, -1}; // 匿名数组 return new int[] {-1, -1}; // 匿名数组
} }
// nums 中存在 targe，则左右滑动指针，来找到符合题意的区间 // nums 中存在 target，则左右滑动指针，来找到符合题意的区间
int left = index; int left = index;
int right = index; int right = index;
// 向左滑动，找左边界 // 向左滑动，找左边界
@ -450,7 +450,7 @@ class Solution:
return -1 return -1
index = binarySearch(nums, target) index = binarySearch(nums, target)
if index == -1:return [-1, -1] # nums 中不存在 target，直接返回 {-1, -1} if index == -1:return [-1, -1] # nums 中不存在 target，直接返回 {-1, -1}
# nums 中存在 targe，则左右滑动指针，来找到符合题意的区间 # nums 中存在 target，则左右滑动指针，来找到符合题意的区间
left, right = index, index left, right = index, index
# 向左滑动，找左边界 # 向左滑动，找左边界
while left -1 >=0 and nums[left - 1] == target: left -=1 while left -1 >=0 and nums[left - 1] == target: left -=1