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

Merge pull request #2107 from zou-weidong/patch-1

Browse Source 
Update 0034.在排序数组中查找元素的第一个和最后一个位置.md
This commit is contained in:
程序员Carl
2023-06-14 09:15:20 +08:00
committed by GitHub
parent 5d344fc825 4a6e87f2f0
commit 882463bbae
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -240,7 +240,7 @@ class Solution {
while (left - 1 >= 0 && nums[left - 1] == nums[index]) { // 防止数组越界。逻辑短路，两个条件顺序不能换 while (left - 1 >= 0 && nums[left - 1] == nums[index]) { // 防止数组越界。逻辑短路，两个条件顺序不能换
left--; left--;
} }
// 向左滑动，找右边界 // 向右滑动，找右边界
while (right + 1 < nums.length && nums[right + 1] == nums[index]) { // 防止数组越界。 while (right + 1 < nums.length && nums[right + 1] == nums[index]) { // 防止数组越界。
right++; right++;
} }