[LeetCode] Search Insert Position 搜索插入位置

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

这道题基本没有什么难度，实在不理解为啥还是Medium难度的，完完全全的应该是Easy啊，三行代码搞定的题，只需要遍历一遍原数组，若当前数字大于或等于目标值，则返回当前坐标，如果遍历结束了，说明目标值比数组中任何一个数都要大，则返回数组长度n即可，代码如下：

解法一：

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

当然，我们还可以用二分搜索法来优化我们的时间复杂度，而且个人认为这种方法应该是面试官们想要考察的算法吧，参见代码如下：

解法二：

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

LeetCode All in One 题目讲解汇总(持续更新中...)

转载于:https://www.cnblogs.com/grandyang/p/4408638.html

[LeetCode] Search Insert Position 搜索插入位置相关推荐

leetcode -- Search Insert Position
2019独角兽企业重金招聘Python工程师标准>>> Search Insert Position Given a sorted array and a target value, ...
LeetCode --Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
[LeetCode]Search Insert Position
原题链接:http://oj.leetcode.com/problems/search-insert-position/ 题意描述: Given a sorted array and a target ...
Leetcode:Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
LeetCode Search Insert Position （二分查找）
题意: 给一个升序的数组,如果target在里面存在了,返回其下标,若不存在,返回其插入后的下标. 思路: 来一个简单的二分查找就行了,注意边界. 1 class Solution { 2 publi ...
LeetCode算法入门- Search Insert Position -day19
LeetCode算法入门- Search Insert Position -day19 题目描述 Given a sorted array and a target value, return the ...
【二分法】LeetCode 35. Search Insert Position
LeetCode 35. Search Insert Position Solution1:我的答案 class Solution { public:int searchInsert(vector&l ...
LeetCode - 35. Search Insert Position
35. Search Insert Position Problem's Link ---------------------------------------------------------- ...
LeetCode题解：35.搜索插入位置
搜索插入位置(easy) 更好的阅读体验应该是: 审题-思考答题整理-归纳一.题目 LeetCode题目链接:35.搜索插入的位置给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引 ...

[LeetCode] Search Insert Position 搜索插入位置

[LeetCode] Search Insert Position 搜索插入位置相关推荐

最新文章

热门文章