题目描述
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
python解法
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
if target in nums:
return nums.index(target)
else:
nums.append(target)
nums.sort()
return nums.index(target)
Runtime: 60 ms, faster than 62.88% of Python3 online submissions for Search Insert Position.
Memory Usage: 14.4 MB, less than 5.53% of Python3 online submissions for Search Insert Position.
题后反思:
- 还是要注意列表的append方法直接在列表的基础上进行修改,返回值是None,这次又写了nums = sorted(nums.append(target)),这是错误的,根本无法排序。
C语言解法
int searchInsert(int* nums, int numsSize, int target){
if(!numsSize || target <= nums[0])
{
return 0;
}
int i = 0;
for(;i<numsSize;i++)
{
if(nums[i]>target)
break;
}
// if(nums[i-1] == target)
// {
// return i-1;
// }
// else
// {
// return i;
// }
return nums[i-1]==target ? i-1 : i;
}
Runtime: 0 ms, faster than 100.00% of C online submissions for Search Insert Position.
Memory Usage: 7.2 MB, less than 52.38% of C online submissions for Search Insert Position.
题后反思:
- C语言三目运算符要注意使用方法,刚开始我写成了 i-1 ? nums[i-1] == target : i;这种写法没问题,但是结果却是错的。
文中都是我个人的理解,如有错误的地方欢迎下方评论告诉我,我及时更正,大家共同进步