mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 07:35:35 +08:00
Update
This commit is contained in:
@ -1,11 +1,12 @@
|
||||
# 题目地址
|
||||
|
||||
https://leetcode-cn.com/problems/search-insert-position/
|
||||

|
||||
|
||||
> 二分查找法是数组里的常用方法,彻底掌握它是十分必要的。
|
||||
|
||||
# 编号35:搜索插入位置
|
||||
|
||||
题目地址:https://leetcode-cn.com/problems/search-insert-position/
|
||||
|
||||
给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
|
||||
|
||||
你可以假设数组中无重复元素。
|
||||
|
Reference in New Issue
Block a user