题目描述:
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位置;
若没找到,暴力遍历第二遍,找到target的插入位置。
AC代码:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for (int i = 0; i < (int)nums.size(); i++) {
if (nums[i] == target)
return i;
}
for (int i = 0; i < (int)nums.size(); i++) {
if (target < nums[i])
return i;
}
return nums.size();
}
};