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

最新推荐文章于 2019-12-17 14:49:20 发布

林下溪源

最新推荐文章于 2019-12-17 14:49:20 发布

阅读量76

点赞数

分类专栏： LeetCode # Arrays 文章标签： LeetCode 算法 Java

本文链接：https://blog.csdn.net/zzyy17/article/details/102500448

版权

LeetCode 同时被 2 个专栏收录

117 篇文章 0 订阅

订阅专栏

Arrays

79 篇文章 0 订阅

订阅专栏

Problem Description:

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].

Example 1:
Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]
Example 2:
Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]

Analysis:

This problem require the runtime complexity must be in order of O(logn), so we might wannt consider the binary search method. The question is we need to take care of the repeated target number which might happen in the array. So when it finds the target number, it just traverse the array along two directions, to find the head and tail of this array.

Code:

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int len = nums.length;
        if(len < 1)
            return new int[]{-1, -1};
        int i = 0, j = len - 1;
        while(i <= j) {
            int t = (i + j)/2;
            if(nums[t] > target) {
                j = t - 1;
            } else if(nums[t] <target) {
                i = t + 1;
            } else {
                int left = t;
                while(left >= 0 && nums[left] == target) {
                    left--;
                }
                int right = t;
                while(right < len && nums[right] == target) {
                    right++;
                }
                return new int[]{left + 1, right - 1};
            }
        }
        return new int[]{-1, -1};
    }
}