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

最新推荐文章于 2021-06-24 13:07:05 发布

hinanmu

最新推荐文章于 2021-06-24 13:07:05 发布

阅读量153

点赞数

本文链接：https://blog.youkuaiyun.com/csdn_47/article/details/89846139

版权

leetcode 专栏收录该内容

37 篇文章

订阅专栏

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

√ Accepted
  √ 88/88 cases passed (8 ms)
  √ Your runtime beats 99.59 % of cpp submissions
  √ Your memory usage beats 98.71 % of cpp submissions (10.5 MB)


class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
    int l = 0;
    int r = nums.size() - 1;
    vector<int> result;
    int flag = 0;
    while (l <= r)
    {
        int mid = l + (r - l) / 2;
        if (nums[mid] == target)
        {

            if (mid == 0 && flag == 0)
            {
                result.push_back(mid);
                flag = 1;
                if (result.size() == 2)
                {
                    break;
                }
                else
                {
                    l = mid;
                    r = nums.size() - 1;
                    continue;
                }
            }
            else if (mid > 0 && nums[mid - 1] < target && flag == 0)
            {
                result.push_back(mid);
                flag = 1;
                if (result.size() == 2)
                {
                    break;
                }
                else
                {
                    l = mid;
                    r = nums.size() - 1;
                    continue;
                }
            }
            else if (mid == nums.size() - 1)
            {
                result.push_back(mid);
                if (result.size() == 2)
                {
                    break;
                }
                else
                {
                    l = 0;
                    r = mid;
                    continue;
                }
            }
            else if (mid < nums.size() - 1 && nums[mid + 1] > target)
            {
                result.push_back(mid);
                if (result.size() == 2)
                {
                    break;
                }
                else
                {
                    l = 0;
                    r = mid;
                    continue;
                }
            }

            if (flag == 0)
            {
                r = mid - 1;
            }
            else
            {
                l = mid + 1;
            }

        }
        else if(nums[mid] < target)
        {
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
        }
    }
    if (result.size() == 0)
    {
        result.push_back(-1);
        result.push_back(-1);
    }
    if (result[0] > result[1])
    {
        int temp = result[0];
        result[0] = result[1];
        result[1] = temp;
    }
        return result;
    }
};