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.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
本题用的是for循环，时间复杂度为o（n），只要是根据题中输入的条件，然后用if - else 进行判断。
今天是第四天做题，第一次没有任何参考，把一道简单的题做出来。很开心，继续加油。