leetCode练习（35）

题目：Search Insert Position

难度：medium

问题描述：

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

解题思路：比较简单，使用二分搜索，可以立可找到正确的位置，不过要仔细判别边界条件。具体代码如下：