34. Find First and Last Position of Element in Sorted Array

于 2022-02-28 10:26:56 发布
阅读量128 收藏
点赞数
分类专栏： leetcode 文章标签： 排序算法 算法 leetcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Xg_316167164/article/details/123176393
版权
这篇博客介绍了如何利用二分查找算法在非递减排序数组中找到目标值的开始和结束位置。博主详细解释了在实现过程中，为何在更新区间时需要对二分查找的mid值做不同的处理，以避免陷入死循环，并提供了问题的解决方案。
摘要由CSDN通过智能技术生成

今天也是任题摆布的一天

在这里插入图片描述

题目搬运者

给定一个整数数组nums按非递减顺序排序，找到给定目标值的开始和结束位置。
如果在数组中没有找到target，则返回[-1，-1]。
你必须写一个运行时复杂度为O(log n)的算法。

思路 二分查找

  1. 先找到最左边target的目标位置tarleft
    如果tarleft都找不到 就可立即返回
  2. 再用更新
		# 找tarright的
        left = tarleft
        right = len(nums) - 1

找tarright的时候 从上一个tarleft 和n-1的位置开始查找，无需再从头查找

为什么两个二分mid取值不同？

对于第二个模板，
当我们更新区间时，如果左边界left 更新为left =mid，此时mid的取值就应为mid=(l+r+1)/2。因为当右边界right=left+1 时，此时mid=(left+left+1)/2 向下取整，mid 仍为left，左边界再次更新为left=mid，相当于没有变化，while循环就会陷入死循环。
因此，我们总结出来一个小技巧，当左边界要更新为left=mid时，我们就令 mid=(left+right+1)/2，上取整&#x

最低0.47元/天 解锁文章
向光光同学
关注
专栏目录
34.Find First and Last Position of Element in Sorted Array
JohnnyZXLiu的博客
01-02 230
Lc-34 34.Find First and Last Position of Element in Sorted Array 题目大意： 给定一个整数数组nums按照递增排序和一个目标整数target， 找出target在数组nums中的起始位置和结束位置，如果没有找到则返回{-1, -1} 要求：编写算法的时间复杂度在O(logN) 解题思路： 根据题目要求，数组为单调递增并且要找出对应的目标整数的起始与结束位置，可以用二分搜索来做 首先我们初始化 ans = {-1, -1}， low = 0，h
leetcode -- 34. Find First and Last Position of Element in Sorted Array
tkzc_csk的博客
11-22 127
题目描述 题目难度：Medium Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O...
【每日一题】34. Find First and Last Position of Element in Sorted Array
Viking的博客
08-08 249
题目描述 Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). If the target is not found in the array, return [-1, -1]. E
34.Find First and Last Position of Element in Sorted Array在排序数组中寻找元素的第一和最后一个位置【LeetCode单题讲解系列】
08-31
34.Find_First_and_Last_Position_of_Element_in_Sorted_Array在排序数组中
【Leetcode】34. 在排序数组中查找元素的第一个和最后一个位置（Find First and Last Position of Element in Sorted Array）
厉兵秣码
06-06 199
Leetcode - 34 Find First and Last Position of Element in Sorted Array (Medium) 题目描述：给定一个有序序列与一个 target 值，求出 target 在有序序列中的区间，时间复杂度要求为 O(logn)，若没有 target 值，则返回 [-1, -1]。 Input: nums = [5,7,7,8,8,10], t...
Leetcode_34 Find First and Last Position of Element in Sorted Array
大洋深处
08-12 251
题目： Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). I...
Leetcode34. Find First and Last Position of Element in Sorted Array
syyyy712的博客
07-14 470
描述： Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). I...
LeetCode #34 - Find First and Last Position of Element in Sorted Array
LawFile的博客
07-18 601
题目描述： Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). ...
Find First and Last Position of Element in Sorted Array
yangzhuhappy的博客
07-20 415
//分两部 先找最小 再找最大 class Solution {     public int[] searchRange(int[] nums, int target) {         if(nums == null || nums.length == 0) return new int[]{-1, -1};         int[] n = new int[] {-1, -1};    ...
LeetCode-Find First and Last Position of Element in Sorted Array
坟头草一米七五
07-27 569
LeetCode Java C++ Find First and Last Position of Element in Sorted Array
Search for a Range leetcode java
weixin_34195142的博客
07-21 79
题目：Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). If the target is not fo...
leetcode34. Find First and Last Position of Element in Sorted Array
zyp7355的博客
02-07 132
Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). If the t...
Write the following code in c #,2. Write a method that takes an argument (an int array) and print each item on a single line separated by a space. From your main, call this method with numbers as argument.6. In your main method use the method in question 2 to display the numbers array, then use the Array.Binarysearch() method to try to find the position of 3 in the numbers array. What is your answer? Now repeat the same steps after you have sorted the array and printed the sorted array
最新发布
05-28
Sure, here's the code in C#: ```csharp using System; class Program { static void Main(string[] args) { int[] numbers = { 4, 2, 6, 3, 7, 1 }; PrintIntArray(numbers); int index = Array.BinarySearch(numbers, 3); Console.WriteLine("Index of 3: " + index); Array.Sort(numbers); PrintIntArray(numbers); index = Array.BinarySearch(numbers, 3); Console.WriteLine("Index of 3: " + index); } static void PrintIntArray(int[] arr) { foreach (int i in arr) { Console.Write(i + " "); } Console.WriteLine(); } } ``` The output of this program will be: ``` 4 2 6 3 7 1 Index of 3: -4 1 2 3 4 6 7 Index of 3: 2 ``` The `PrintIntArray` method takes an int array as an argument and prints out each element separated by a space. In the `Main` method, we first call `PrintIntArray` to display the original `numbers` array. We then use the `Array.BinarySearch` method to try to find the index of 3 in the array, which returns -4 since 3 is not found. We then sort the `numbers` array using the `Array.Sort` method, and call `PrintIntArray` to display the sorted array. We then use `Array.BinarySearch` again to find the index of 3 in the sorted array, which now returns 2 since 3 is the third element in the sorted array.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值