1
class Solution {
2
 public:
3
  int searchInsert(vector<int> &nums, int target) {
4
    int ans = 0;
5
    int size = nums.size();
6
    if (target > nums[size - 1]) {
7
      return nums.size();
8
    }
9
    for (int i = 0; i < nums.size(); i++) {
10
      while (target > nums[i]) {
11
        if (target == nums[i]) {
12
          return i;
13
          i++;
14
        }
15
        ans = i + 1;
16
        i++;
17
      }
18
    }
19
    return ans;
20
  }
21
};