题目内容:
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
题目分析:
此题的思路较为简单,注意插入的数在数组中最小和最大的情况。
题目代码:
public class Solution {
public static int searchInsert(int[] nums, int target) {
for(int i = 0;i<nums.length;i++){
if(nums[i]==target)return i;
if(nums[i]>target)return i==0?0:i;
}
return nums.length;
}
}