LeetCode -- Search Insert Position

题目：

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.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4

[1,3,5,6], 0 → 0

注意点：当检索完数组的全部元素还未找到则插入最后。

代码

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