35. Search Insert Position
来源:互联网 发布:rbac java 实现 编辑:程序博客网 时间:2024/06/05 10:42
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, j = nums.size()-1; if(target <= nums[0]) return 0; if(target > nums[j]) return j+1; while(i < j){ int mid = (i + j) / 2; if(nums[mid] < target) i = mid + 1; else j = mid; } return i; }};
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
- ajax的总结和使用
- unity pc 端怎么去掉运行时的提示框
- exlipse 配置 java home 及tomcat
- oracle 生成指定长度字符串的函数
- OPENSTACK的可伸缩架构的基础:RPC——超大规模高可用OpenStack核心技术深入解析系列
- 35. Search Insert Position
- leetcode oj java Counting Bits
- 各类分析函数调用关系图的工具
- K64使用寄存器控制GPIO
- [树上LIS 线段树合并] Codeforces 490F #279 (Div. 2) F. Treeland Tour
- Java线程创建有两种方式
- HttpUploadFile模拟前台POST上传图片和后台获取上传图片并上传至服务器
- 子div有内容,父div高度为0的解决方法
- 消息队列基础 RabbitMQ与AMQP协议详解——超大规模高可用OpenStack核心技术深入解析系列(二)