LeetCode 35. Search Insert Position
来源:互联网 发布:妩媚航班 知乎 编辑:程序博客网 时间:2024/06/05 08:02
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.
Here are few examples.[1,3,5,6]
, 5 → 2[1,3,5,6]
, 2 → 1[1,3,5,6]
, 7 → 4
[1,3,5,6]
, 0 → 0
这道题主要考察二分查找。代码如下:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int i = 0;
int j = nums.size() - 1;
while (i <= j){
int mid = (i + j) >> 1;
if (nums[mid] == target)
return mid;
else if (nums[mid] < target)
i = mid + 1;
else
j = mid - 1;
}
return i; //当找不到时,i值会相应的指示。
}
};
阅读全文
0 0
- [LeetCode]35.Search Insert Position
- LeetCode --- 35. Search Insert Position
- LeetCode 35.Search Insert Position
- [Leetcode] 35. Search Insert Position
- LeetCode 35. Search Insert Position
- [leetcode] 35.Search Insert Position
- Leetcode 35. Search Insert Position
- 35. Search Insert Position LeetCode
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- 【LeetCode】35. Search Insert Position
- leetcode 35. Search Insert Position
- leetcode 35. Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode *** 35. Search Insert Position
- leetcode 35. Search Insert Position
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- awk sort cut uniq 速查
- Java中HashSet、HashTable和HashMap
- hdu2084 数塔
- springmvc异常统一处理
- JS&jQuery初级08
- LeetCode 35. Search Insert Position
- [NOIP]数字三角形
- SVC较好的介绍资料
- Android图像处理之图形特效处理
- 度度熊与邪恶大魔王
- 剑指offer:链表中环的入口结点
- C语言模式实现C++继承和多态
- 西安房价在下个月内什么地方最值得买?——下篇
- shell 基本认识