34. Search for a Range
来源:互联网 发布:长沙蓝狐网络 编辑:程序博客网 时间:2024/05/29 13:20
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[] result = new int[2]; result[0] = findFirst(nums, target); result[1] = findLast(nums, target); return result; }private int findFirst(int[] nums, int target){ int idx = -1; int start = 0; int end = nums.length - 1; while(start <= end){ int mid = (start + end) / 2; if(nums[mid] >= target){ end = mid - 1; }else{ start = mid + 1; } if(nums[mid] == target) idx = mid; } return idx;}private int findLast(int[] nums, int target){ int idx = -1; int start = 0; int end = nums.length - 1; while(start <= end){ int mid = (start + end) / 2; if(nums[mid] <= target){ start = mid + 1; }else{ end = mid - 1; } if(nums[mid] == target) idx = mid; } return idx;}}
阅读全文
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
- 如何在官网下载 >>>>红帽企业版linux
- C#:IComparable和ICompare
- Codeigniter提示:Undefined property: XXXX::$db的解决方法
- POJ2135
- Linux使用动态ip(dhcp)切换成静态ip后无法联网的问题
- 34. Search for a Range
- EOJ----足球锦标赛
- 1002.写出这个数
- Java.lang学习笔记
- 枚举排列
- java--异常总结
- 算法训练:Continuous Subarray Sum
- 利用apache commons-email发送邮件
- 常用技术框架或开源库