35. Search Insert Position
来源:互联网 发布:php 开源网盘系统 编辑:程序博客网 时间:2024/06/15 20:10
题目:
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 low = 0, high = nums.size() - 1; while (low <= high) { int mid = (low + high) / 2; if (nums[mid] < target) low = mid + 1; else high = mid - 1; } return low; }};
解题思路:
采用二分搜索,把问题分解为做多个子问题,速度更快。
阅读全文
0 0
- 35.Search Insert Position
- 35. Search Insert Position
- 35.Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- Java面试题全集(上)
- 数据结构----插入排序
- Ctrl键组合
- 解决Android Studio 新建导入项目时死掉
- postgresql与Oracle:空字符串与null
- 35. Search Insert Position
- 实验 折半查找算法
- setInterval第一个参数加引号与不加引号区别
- Android图片加载-TakePhoto
- java 获取当前类的所有父类
- 【0018】navicat导出sql语句
- OpenSSL 静态、共享编译,解决ms\do_ms报错
- 【vmware 服务器安装】虚拟机centos6.5安装步骤
- 对json数组进行排序和filter过滤