learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Update 0034.在排序数组中查找元素的第一个和最后一个位置.md

This commit is contained in:
August 2023-05-28 23:57:29 +08:00 committed by GitHub
parent 60a2d4bfa7
commit 4a6e87f2f0
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats 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++;
} }