[leet code] 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

第一个自己一下就能写出来的题目. (底子比较薄, 本科毕业的时候估计还没写够500行代码, 有时间另文叙述).

思路总结:

根据题目要求得出三种情况:

1. 能在数组中找到, 返回index

2. 需插入到数组中 (返回第一个大于target的数组元素index)

3. target大于所有数组元素

于是依次在代码中实现该思路:

public class Solution {
    public int searchInsert(int[] A, int target) {
        if (A.length == 0) return 0;
        for (int i=0; i<A.length; i++){
            //check if exist, return index
            if (A[i] == target) return i;
            //return the first array index, value of which > target
            else if (A[i]>target) return i; 
        }
        // target > all the elements in the array
        return A.length;
    }
}