给定排序数组和目标值，如果找到目标，则返回索引。 如果没有，请返回索引按顺序插入的索引。
您可以假设数组中没有重复项。
Example 1:
Input: [1,3,5,6], 5
Output: 2
Example 2:
Input: [1,3,5,6], 2
Output: 1
Example 3:
Input: [1,3,5,6], 7
Output: 4
Example 4:
Input: [1,3,5,6], 0
Output: 0
Java代码实现如下：
package 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.
*/
public class SearchInsertPosition {
public static int searchInsert(int[] nums, int target) {
for(int i=0;i<nums.length;i++){
if(target <=nums[i]){
return i;
}
}
return nums.length;
}
public static void main(String[] args) {
int[] nums = {1,3,5,6};
System.out.println(searchInsert(nums,5));
System.out.println(searchInsert(nums,2));
System.out.println(searchInsert(nums,7));
System.out.println(searchInsert(nums,0));
}
}