search-insert-position

题目来源：leetcode

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

思路:遍历，比较寻找插入位置easy

 public int searchInsert(int[] nums, int target) {        int index=0;        if(nums.length==0)            return 0;        for(int i=0;i<nums.length;i++){            if (i<nums.length-1) {                if (target <= nums[i])                    return i;                else if (target > nums[i + 1])                    continue;                else                    return i+1;            }        }        return target>nums[nums.length-1]?nums.length:nums.length-1;    }