[LeetCode]35. Search Insert Position

Description:

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

——————————————————————————————————————————————————————————————————————————

Solution:

简单的二分查找法，但是特别注意的是：最后return 的是left而不是mid，原因在于，在增序数组中，经二分查找后，left一定停在恰好比target大的位置，right一定停在比target小的位置！