[35] Search Insert Position

Updated on in LeetCode with 0 views and 0 comments

题目

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

解法

一:暴力

思路

for循环即可

代码

LeetCode.35.1.png

二:二分查找

思路

使用二分查找

代码

LeetCode.35.2.png