35. Search Insert Position

Question
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.

• second attempt

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