Description
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
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
Submissions
我的解题思路是利用34题提到的python index()方法,首先如果target在nums中则利用index()方法直接输出索引位置,如果不在,则将target添加到nums中,并将nums排序,再利用index()方法输出索引位置。
实现代码如下:
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
try:
return nums.index(target)
except:
nums.append(target)
nums.sort()
return nums.index(target)
Runtime: 48 ms
Memory Usage: 14.5 MB