public class Solution { public int searchInsert(int[] nums, int target) { int len=nums.length; int i=0; for(;i<len;i++) { if(nums[i]>=target) break; } return i; } }
35. Search Insert Position
原文：http://www.cnblogs.com/aguai1992/p/5351442.html
