35. 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.
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
解題思路
程式解答
class Solution
{
public:
int searchInsert(vector<int>& nums, int target)
{
int i = 0;
for (i = 0; i < nums.size(); i++)
if (target <= nums[i])
return i;
return i;
}
};
Last updated
Was this helpful?