LeetCode之Search Insert Position
来源:互联网 发布:ubuntu怎么上传lrzsz包 编辑:程序博客网 时间:2024/05/01 00:42
1、问题
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
2、分析
我们这里用二分法,然后要注意的是,获取中间的下标是开始下标加末尾小标除以2,而不是末尾下标减去开始下标除以2,这里以后要注意。
3、代码实现
public static int searchInsert(int[] nums, int target) { int index = 0; if (nums == null || nums.length == 0) { return index; } if (target <= nums[0]) { return 0; } int length = nums.length; int start = 0; int end = length; while (start <= end) { int mid = (end + start) / 2; if (target < nums[mid]) { end = mid; } else if (target > nums[mid]){ start = mid; } else { return mid; } if (start - end == -1) { return start + 1; } } return index; }
阅读全文
0 0
- leetcode之Search Insert Position
- LeetCode 之 Search Insert Position
- LeetCode之Search Insert Position
- LeetCode之Search Insert Position
- LeetCode之Search Insert Position
- leetcode 之 Search Insert Position
- LeetCode之Search Insert Position
- LeetCode之Search Insert Position
- leetcode之Search Insert Position
- 【Leetcode】之Search Insert Position
- LeetCode之Search Insert Position
- LeetCode之Search Insert Position(C++)
- leetcode之路035 Search Insert Position
- Leetcode之Search Insert Position 问题
- LeetCode: Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- OpenGL 03 绘制命令
- Linux 之GIT 安装(centos6.5)
- 文件上传与下载权限的控制
- 2017.08.06
- tcp头部没有数据长度信息
- LeetCode之Search Insert Position
- this super
- win10管理员已阻止你运行此应用”解决方法
- linux文件系统编程 标准IO
- linux基础知识点复习
- C++函数名与函数指针
- 在iframe中使bootstrap的模态框在父页面弹出
- DNS and Bind 以及DNS服务器的构建
- 最少硬币问题