35. Search Insert Position —— Java

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

nums是一个排序过的数组，如果target在数组中，返回其index；如果没有，返回target应该插入数组中的index。

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