关闭

LeetCode 34. Search for a Range

标签: leetcode
82人阅读 评论(0) 收藏 举报
分类:

Given a sorted array of integers, 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].



1、有序数组,第一时间想到的就是二分法。

vector<int> searchRange(vector<int>& nums, int target)
    {
        vector<int> res;
        int low = -1;
        int high = -1;
        int start = 0;
        int end = nums.size()-1;
        while(start <= end)
        {
            int mid = (start + end)/2;
            if(nums[mid] > target)
            {
                end = mid - 1;
            }
            else if(nums[mid] < target)
            {
                start = mid + 1;
            }
            else
            {
                low = high = mid;
                while((high + 1) <nums.size() && nums[high + 1] == target)
                    high++;
                while((low -1) >=0 && nums[low - 1] == target)
                    low--;
                res.push_back(low);
                res.push_back(high);
                return res;
            }
        }
        res.push_back(low);
        res.push_back(high);
        return res;
    }

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:31084次
    • 积分:1370
    • 等级:
    • 排名:千里之外
    • 原创:108篇
    • 转载:16篇
    • 译文:0篇
    • 评论:14条
    最新评论