35. Search Insert Position
来源:互联网 发布:中农数据食堂采配平台 编辑:程序博客网 时间:2024/06/10 08:53
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(int[] nums, int target) { int len = nums.length; int pos = -1; for (int i = 0; i < len; ++ i){ if (nums[i] == target){ return i; } if (nums[i] > target){ pos = i; break; } } if (pos == -1){ return len; } return pos; }}
阅读全文
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
- Redis设计与实现 --- 单机数据库
- vSAN架构细节(3)
- mac下hadoop环境的搭建以及碰到的坑点
- [LeetCode] Algorithms-257. Binary Tree Paths
- svn
- 35. Search Insert Position
- 我的第一篇博客
- 在docker环境部署RabbitMQ并使用
- pandas时间序列
- Tomcat基本配置及常见问题
- 【POJ
- C++封装select模型
- 电路板上电源和地短路,电压一定会被拉到0v吗?
- pandas时间序列频率处理