LeetCode_35. Search Insert Position

***About vector, we can refer to the link below:
https://www.runoob.com/w3cnote/cpp-vector-container-analysis.html
https://blog.csdn.net/AFishhhhhh/article/details/79980359

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

Solution below:

class Solution {
public:
    int searchInsert(vector<int>& A, int target) {
        int n = A.size();
        int left = 0;
        int right = n - 1;
        int mid = 0;
        while(left<=right){
            mid = (left + right) / 2;
            if(A[mid]>target){
                right = mid - 1;
            }
            else if(A[mid]<target){
                left = mid + 1;
            }
            else{
                return mid;
            }
        }
        return left;
    }
};