ChuanjieZhu

第一点:通俗易懂;第二点:准确深刻;第三点:贯彻以上两点。

Search Insert Position(LeetCode)

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.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 0

思路:

二分查找,找到就返回mid,找不到就返回low。

class Solution {
public:
	int searchInsert(vector<int>& nums, int target) {
		int n=nums.size();
		int low=0;
		int high=n-1;
		while(low<=high){
			int mid = low+(high-low)/2;
			if(nums[mid]>target) high=mid-1;
			else if(nums[mid]<target) low=mid+1;
			else return mid;
		}
		return low;
	}
};


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u014485485/article/details/80335356
个人分类: 数据结构与算法
想对作者说点什么? 我来说一句

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

不良信息举报

Search Insert Position(LeetCode)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭