Search Insert Position
2016-05-07 20:05
309 查看
题目描述:
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
二分法
思路比较简单了,直接上代码
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
二分法
思路比较简单了,直接上代码
public class Solution { public int searchInsert(int[] nums, int target) { if(nums.length==0) return 0; return binarySearch(nums, 0, nums.length-1, target); } public int binarySearch(int[] nums,int left,int right,int target){ if(left==right){ if(nums[left]>=target) return left; else return left+1; } int mid=(left+right)/2; if(target==nums[mid]){ return mid; }else if(target>nums[mid]){ return binarySearch(nums, mid+1, right, target); }else if(target<nums[mid]){ return binarySearch(nums, left, mid, target); } return 0; } }
相关文章推荐
- POJ 2236 Wireless Network【并查集】
- 关于机器学习会议的点评
- mybatis缓存学习笔记
- HTTP 请求:GET vs. POST
- 反射 类加载与垃圾回收
- mybatis缓存学习笔记
- Codeforces Round #350 (Div. 2) C. Cinema
- BZOJ 2055:80人环游世界
- 【VS开发】内存泄漏相关问题
- Spring面试题和答案
- echartsJS初探--图形报表
- CSS position属性详解
- 有向无环图(DAG)的最小路径覆盖(转)
- 删除集合里重复的字符串
- C++中模板的使用
- ubuntu16.04 打不开eclipse
- C++中模板的使用
- n皇后问题
- HDU 3152Obstacle Course (BFS ,记忆化???)
- Struts2运行过程以及StrutsPrepareAndExecuteFilter源码阅读