34. Search for a Range
来源:互联网 发布:php网站提权 编辑:程序博客网 时间:2024/06/15 19:58
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]
.
public class Solution { public int[] searchRange(int[] nums, int target) { int[] res = {-1, -1}; int left = -1, right = nums.length; while (left + 1 < right) { int mid = left + (right - left) / 2; if (nums[mid] < target) { left = mid; } else { right = mid; } } int left2 = -1, right2 = nums.length; while (left2 + 1 < right2) { int mid = left2 + (right2 - left2) / 2; if (nums[mid] > target) { right2 = mid; } else { left2 = mid; } } if (left + 1 <= right2 - 1) { res[0] = left + 1; res[1] = right2 - 1; } return res; }}
0 0
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- 34. Search for a Range
- MyBatis Generator 源码分析
- Leetcode-Algorithms Add Two Numbers
- 串口显示
- 初见 nodejs
- UML系列图--用例图
- 34. Search for a Range
- nodejs 的基本使用
- Spring学习笔记专题一
- 如何正确搭建能远程访问你的SVN服务器(亲测有效)
- Qt for Android获取手机热点开关状态
- 时钟问题造成的hive运行错误
- 刚开,纪念一下
- 卷积的意义
- Firefox浏览器直接调试jQuery或underscore的方法