LeetCode 34 Search for a Range
来源:互联网 发布:数据备份方式 编辑:程序博客网 时间:2024/06/10 08:51
原题:(频率3)
Given an array of integers 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]
.
For example,
Given [5, 7, 7, 8, 8, 10]
and target value 8,
return [3, 4]
.
题意:给一个升序数组,找到某target的开始和结束位置
代码和思路:
class Solution { public int[] searchRange(int[] nums, int target) { int l=0,len=nums.length,r=len-1,mid=0; int[] res = new int[2]; while(l<=r){ //>>1比 /2要快 mid = (l+r)>>1; if(nums[mid]==target) break; else if(nums[mid] > target){ r = mid - 1; } else l = mid + 1; } //上面的代码找到target后,还要进行重复数字的位置判断 if(l<=r){ //下面操作完后,l在target开始左边一位,r在结束右边一位 l = mid - 1; while(l>=0 && nums[l]==nums[mid]) l--; r = mid + 1; while(r<len && nums[r] == nums[mid]) r++; res[0]=l+1; res[1]=r-1; }else{ res[0]=-1; res[1]=-1; } return res; }}
阅读全文
0 0
- LeetCode(34)Search for a Range
- [LeetCode] Search for a Range [34]
- LeetCode 34 Search for a Range
- [leetcode 34] Search for a Range
- Leetcode NO.34 Search for a Range
- [LeetCode 34]Search for a Range
- leetcode-34 Search for a Range
- Leetcode 34 Search for a Range
- Search for a Range - LeetCode 34
- leetcode 34 -- Search for a Range
- leetcode 34: Search for a Range
- Leetcode#34 Search for a Range
- LeetCode(34) Search for a Range
- LeetCode 34: Search for a Range
- [Leetcode 34, Medium] Search for a Range
- [leetcode-34]Search for a Range(C)
- Leetcode#34||Search for a Range
- LeetCode(34)Search for a Range
- hdu2883kebab (最大流+时间段离散+构图思维)
- [leetcode] 404. Sum of Left Leaves
- 单例模式的总结
- 头一次被黑!阿里云与腾讯云两台服务器数据库均被清空,比特币额
- Git客户端的常用配置
- LeetCode 34 Search for a Range
- Echarts 饼状图的标注 字体等样式修改
- SPOJ-1029 MATSUM
- b树,b+树,红黑树
- Fragment引起错误(待完成)
- 深度学习Day2(神经网络的基础编程)
- 【互联网安全】阿里云安全专家为你详细解读内容安全及防护
- Spring Integration 学习笔记
- git_快速入门 03【三种境界】全世界朋友一起玩