LeetCode 35 Search Insert Position
#include <vector>
using namespace std;
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if (nums[0] > target)
return 0;
for (int i = 0; i < nums.size(); i++){
if (nums[i] == target)
return i;
else if (nums[i] < target && target < nums[i + 1])
return i + 1;
}
return nums.size();
}
};