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
public class Solution {
public int SearchInsert(int[] nums, int target) {
int l = 0;
int r = nums.Length-1;
int mid = 0;
while(l<=r){
mid = l + (r-l)/2;
Console.WriteLine($"{l} : {r} : {mid}");
if(nums[mid]>target){
r = mid-1;
}
else if(nums[mid]<target){
l = mid+1;
}
else if(nums[mid] == target){
return mid;
}
}
return nums[mid]>target?mid:mid+1;
}
}Time Complexity: O(logn)
Space Complexity: O(1)
