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
分析：
给出一个数组和一个target数字，找到数组中能插入该数字的位置，
这道题是要找到数组中第一个大于等于target的位置。
public class Solution { public int searchInsert(int[] nums, int target) { if (nums.length == 0){ return 0; } int start = 0, end = nums.length - 1; while(start + 1 < end){ int mid = start + (end - start) / 2; if (target == nums[mid]){ return mid; } if (target < nums[mid]){ end = mid; }else{ start = mid; } } if (nums[start] >= target){ return start; } if (nums[end] >= target){ return end; } return nums.length; } }
leetcode 35. Search Insert Position
原文：http://www.cnblogs.com/iwangzheng/p/5745041.html