LeetCode:35. Search Insert Position
来源:互联网 发布:java关键字定义常量 编辑:程序博客网 时间:2024/05/16 08:57
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
Java Solution
public class Solution { public int searchInsert(int[] nums, int target) { int front = 0, end = nums.length - 1, mid; while (front <= end) { mid = (front + end) / 2; if (target == nums[mid]) return mid; else if (target > nums[mid]) front = mid + 1; else end = mid - 1; } return front; }}
阅读全文
0 0
- [LeetCode]35.Search Insert Position
- LeetCode --- 35. Search Insert Position
- LeetCode 35.Search Insert Position
- [Leetcode] 35. Search Insert Position
- LeetCode 35. Search Insert Position
- [leetcode] 35.Search Insert Position
- Leetcode 35. Search Insert Position
- 35. Search Insert Position LeetCode
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- 【LeetCode】35. Search Insert Position
- leetcode 35. Search Insert Position
- leetcode 35. Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode *** 35. Search Insert Position
- leetcode 35. Search Insert Position
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- 机器学习符号表
- java与android的接口回调
- HDU-5961(bitset)
- 搞ACM的你伤不起(转)
- 线程与进程区别
- LeetCode:35. Search Insert Position
- 手写VUE mvvm双向数据绑定
- 各种数据操作的写法 data dm delta
- ViewStub 用法详解
- python opencv入门 直方图均衡化(22)
- Java生成并合并图片以及base64转图片
- JHtml::_() 常见演示及说明
- 获取网卡的mac和指定ip地址的mac
- Spring学习日记