35. Search Insert Position **
来源:互联网 发布:在淘宝做直通车多少钱 编辑:程序博客网 时间:2024/06/01 07: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
My code:
class Solution(object): def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ left = 0 right = len(nums)-1 if nums[left]>=target: return left if nums[right]<target: return right+1 mid = (left + right)/2 while left <right-1: mid = (left+right)/2 if target==nums[mid]: return mid elif target<nums[mid]: right =mid else: left = mid return right
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
- CENTOS 7.2 使用 RDO 安装 OPENSTACK
- 151. Reverse Words in a String
- linux下grep用法
- MATLAB数学建模(6)-蒙特卡洛算法
- HDU 1402及51 nod1028 大数乘法 V2(FFT 快速傅里叶变换)
- 35. Search Insert Position **
- ZZULIOJ 1874: 蛤玮学计网
- Morris Traversal方法遍历二叉树
- HBASE入门概念和基本操作命令
- InfoQ学习笔记
- weX5中Tomact服务启动错误
- html注意事项01
- 使用maven加载项目中缺少的jar包
- 对象初始化 类别