# Leetcode 34. Search for a Range

86人阅读 评论(0)

/**
* Two binary search.
* When isLeft is true search the left index of the target,
* else search the right index of the index.
*/
public class Solution {
public static int helper(int[] nums, int target, boolean isLeft) {
int low = 0, high = nums.length-1, mid = 0;
while (low <= high) {                                   // note low <= high not low < high cuz three if else
mid = (low+high) >> 1;
if (nums[mid] == target) {
if (isLeft) {
if (mid == 0 || nums[mid] > nums[mid-1])    // be careful about the corner case when using nums[i+1] or nums[i-1]
return mid;
high = mid - 1;
}
else {
if (mid == nums.length-1 || nums[mid] < nums[mid+1])
return mid;
low = mid + 1;
}
}
else if (nums[mid] > target) high = mid - 1;
else low = mid + 1;
}
return -1;
}

public int[] searchRange(int[] nums, int target) {
if (nums.length == 1)
return (nums[0] == target) ? new int[] {0, 0} : new int[] {-1, -1};

if (helper(nums, target, true) == -1)
return new int[] {-1, -1};

int left = helper(nums, target, true), right = helper(nums, target, false);
return new int[] {left, right};
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：15980次
• 积分：1950
• 等级：
• 排名：千里之外
• 原创：183篇
• 转载：34篇
• 译文：0篇
• 评论：0条
文章分类