LeetCode 035: Search Insert Position

035. Search Insert Position

Difficulty: Medium

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

思路

这道题蛮简单的，就是一一比较给定值target和有序数组nums的元素。

若数组包含target，返回target的下标；

若不包含，返回应该插入的位置，其实就是第一个比target大的元素的下标。

然后就会发现以上两种情况可以用同样语句搞定：nums[i] >= target。

代码

[C++]

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