LeetCode 34. Search for a Range

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;
    }

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u014221279/article/details/51544498
文章标签: leetcode
个人分类: leetcode刷题
上一篇LeetCode 344. Reverse String
下一篇LeetCode 278. First Bad Version
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭