https://leetcode.com/problems/search-insert-position/
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int len = nums.size();
for(int i = 0;i < len;i++){
if(target == nums[i])
return i;
}
for(int i = 0;i < len;i++){
if(target < nums[i])
return i;
}
}
};