题目

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

思路

从0位开始顺序扫一遍，若当前位的树大于target，则返回当前位置

（注：改进算法可以用二分法）

代码

public class Solution { public int searchInsert(int[] nums, int target) { int i = 0 ; for( ; i < nums.length ; ++ i){ if(nums[i] >= target ){ return i; } } return i; } }