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.
Example
[1,3,5,6]
, 5 → 2
[1,3,5,6]
, 2 → 1
[1,3,5,6]
, 7 → 4
[1,3,5,6]
, 0 → 0
解题思路
普通方法JAVA(6ms):
public class Solution {
public int searchInsert(int[] nums, int target) {
for(int i = 0;i<nums.length; i++){
if(nums[i] == target){
return i;
}
}
for(int i = 0; i<nums.length;i++){
if(nums[0] > target){
return 0;
}else if(nums[i] > target){
return i;
}else if(i == nums.length - 1){
return nums.length;
}
}
return 0;
}
}
二分方法JAVA(5ms):
public class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0,right = nums.length-1,mid;
if(target < nums[0]){
return 0;
}
while(left<=right){
mid = (left + right)/2;
if(nums[mid] < target ){
left = mid + 1;
}else if(nums[mid] > target){
right = mid - 1;
}else{
return mid;
}
}
return left;
}
}