35. Search Insert Position
来源:互联网 发布:欧姆社 漫画数据库 编辑:程序博客网 时间:2024/06/05 14:27
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
思路: 二分法
public int searchInsert(int[] nums, int target) { int len=nums.length; int index; int left=0,right=len-1,mid; while(left<=right){ mid=(left+right)/2; if(nums[mid]==target) return mid; else if(nums[mid]<target) left=mid+1; else right=mid-1; } return left; }
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
- mybatis bind 插入不同表
- Linux 将成为 21 世纪汽车的主要操作系统
- Android中的Handler信息传递机制
- AutoCAD各版本注册表参数
- 1008. Elevator (20)
- 35. Search Insert Position
- thinkphp CRUD
- 让Bootstrap轮播插件carousel支持左右滑动手势的三种方法
- Bionic简介
- java的动态代理机制详解
- Vs解决方案的目录结构设置和管理
- 逻辑题目整理
- springmvc 定时器
- 尝试的SSM框架(留给自己纪念)