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 wocould 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
Solution 1: linear search)
class Solution {public: int searchInsert(int A[], int n, int target) { int low = 0; int high = n-1; int mid = (low+high)/2; while(low <= high) { if(A[mid] == target) return mid; else if(A[mid] > target) { high = mid-1; mid = (low+high)/2; } else { low = mid+1; mid = (low+high)/2; } } return low; }};
Solution 2: Binary Search)
class Solution {public: int searchInsert(int A[], int n, int target) { int low = 0; int high = n-1; int mid = (low+high)/2; while(low <= high) { if(A[mid] == target) return mid; else if(A[mid] > target) { high = mid-1; mid = (low+high)/2; } else { low = mid+1; mid = (low+high)/2; } } return low; }};