Insert Position.cpp

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size();
        for(int i =0; i<nums.size(); i++){
            if(nums[i]>=target){
                return i;
                break;
            }
            if(nums[n-1]<target){
                return n;
            }
        }
        return -1;
    }
};