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

直接上代码：

int searchInsert(int* nums, int numsSize, int target) {    int n;    for(n=0;n<numsSize;n++)    {        if(*(nums+n)==target)        return n;        if(*(nums+n)>target)        return n;    }    return n;}

不废话了感觉，今天心态爆炸，做的一个hard一个medium越写越晕。

感情这种东西真他妈烦。

就只能欺负这个easy了- -