Search Insert Position

插入排序

    int searchInsert(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int i;
        for(i = 0; i < n; i++){
            if(A[i] >= target)
                return i;
            else if(A[i] < target)
                continue;
        }
        if(i == n)
            return n;
    }