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;
    }
};