LeetCode 35：Search Insert Position

最新推荐文章于 2022-05-01 17:05:10 发布

「已注销」

最新推荐文章于 2022-05-01 17:05:10 发布

阅读量589

点赞数 1

分类专栏： LeetCode LeetCode算法分析文章标签： LeetCode

本文链接：https://blog.csdn.net/sunao2002002/article/details/46507247

版权

LeetCode 同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode算法分析

76 篇文章 22 订阅

订阅专栏

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

此题是要在一个有序的数组中，找到某一元素出现的位置，不存在的情况下，返回插入位置。

代码如下：

顺序查找算法：

int searchInsert(vector<int>& nums, int target) {
		int length = nums.size();
		int i = 0;
		if (length == 0)
			return 0;
		for (i=0; i<length; i++)
		{
			if (nums[i] >= target)
				break;
		}
		return i;
	}

二分查找算法：

class Solution {
public:
    
      int searchInsert(vector<int>& nums, int target) {
        int length = nums.size();
        int begin = 0;
        int end = length;
        while(begin <= end){
            if(nums[begin] >= target)
                return begin;
            if(target > nums[end -1])
                return end;
            int middle = (begin + end )/2;
            int tmp = nums[middle];
            if(tmp == target)
                return middle;
            else if(tmp > target)
                end = middle;
            else
                begin = middle;
        }
        return begin;
        
        
    }
};