标签：ack public bsp osi where get round 题目 logs
一、题目要求
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;
int low=0;
int high=nums.length-1;
int mid;
while(low<=high){
mid=(low + high)/2;
if(nums[mid]==target){
return mid;
}else if(target<nums[mid]){
high=mid-1;
}else{
low= mid+1;
}
}
return low;
}
}
Leetcode 35. Search Insert Position
标签：ack public bsp osi where get round 题目 logs
原文地址：http://www.cnblogs.com/lyr2015/p/6391462.html
