题目描述
题目难度 : Easy
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
解法1
class Solution {
public int searchInsert(int[] nums, int target) {
if(nums == null || nums.length == 0) return -1;
int low = 0,high = nums.length - 1,mid = 0;
while(low <= high){
mid = low + (high - low) / 2;
if(nums[mid] > target) high = mid - 1;
else
if(nums[mid] < target) low = mid + 1;
else return mid;
}
return (nums[mid] < target) ? mid + 1: mid;
}
}
解法2
大佬解法
class Solution {
public int searchInsert(int[] nums, int target) {
int l = 0, r = nums.length;
while (l < r) {
int mid = l + (r - l) / 2;
if (nums[mid] < target) l = mid + 1;
else r = mid;
}
return l;
}
}