LeetCode 35 -Search Insert Position ( JAVA )

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

public class Solution {
    public int searchInsert(int[] nums, int target) {
        int result = 0;
        boolean flag = false;
        
        if(target <= nums[0]){
            return 0;
        }
        if(target > nums[nums.length-1]){
            return nums.length;
        }
        
        for(int i = 0 ; i<nums.length ; i++){
            if(nums[i] == target){
                result = i;
                flag = true;
                break;
            }
        }
        if(!flag){
            for(int i = 0 ; i<nums.length-1 ; i++){
                if(target > nums[i] && target <nums[i+1]){
                    return i+1;
                }
            }
        }
        return result;
    }
}

总结：整体代码效率不高，算法思想为：首先把边界的问题解决掉，之后如果target跟数组里面有相同的就直接返回，如果不返回，就在向下执行，找处于数组2个数之间的找到具体位置。