Description:
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.
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
题意:给定一个排序的数组和一个目标元素,要求找出目标元素插入的位置;
解法:元素可以插入的位置范围为[0, length],因此,我们只需要找第一个大于或等于目标元素的数字就可以了;
class Solution {
public int searchInsert(int[] nums, int target) {
int pos = 0;
while(pos < nums.length && nums[pos] < target) {
pos++;
}
return pos;
}
}