Search Insert Position
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.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
O(log(n)) time
public class Solution { /** * param A : an integer sorted array * param target : an integer to be inserted * return : an integer */ public int searchInsert(int[] A, int target) { // write your code here if(A.length<0) return 0; int j=0; for(int i=0;i<A.length;i++) { if(A[i]==target) { j=i; } else if(A[i]<target) { j++; } } return j; } }
[lintcode easy]Search Insert Position
原文：http://www.cnblogs.com/kittyamin/p/4993521.html