【LeetCode】35. Search Insert Position

35. 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.

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大于数组中的所有数时，有数组越界

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