Search Insert Position -- LeetCode, wordsearchleetcode

Search Insert Position -- LeetCode, wordsearchleetcode
Question:

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

Idea: use binary search

<Pre name = "code" class = "cpp"> # include <iostream> # include <vector> using namespace std; /* find an appropriate insert position for an element in an sorted array and use the binary search method. */int InsertPos (vector <int> & vec, int key) {int mid, begin = 0, end = vec. size ()-1; while (begin <= end) {mid = begin + (end-begin)/2; if (vec [mid] = key) return mid; else if (vec [mid] <key) begin = mid + 1; elseend = mid-1;} return mid> = vec. size ()-1? Vec. size (): mid;} int main () {int array [] = {1, 8, 9, 12, 15}; vector <int> vec (array, array + sizeof (array) /sizeof (int); cout <InsertPos (vec, 100); return 0 ;}