leetcode_35. 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 index = 0;        int size = nums.size();        for(int i = 0; i < size; ++i){            if(target > nums[i]){                index = i + 1;            }            if(target <= nums[i]){                break;            }        }                return index;    }};