剑指LeetCode -- 第三十五题 -- 搜索插入位置 -- 简单

class Solution {
    public int searchInsert(int[] nums, int target) {
        int result = -1, L = 0, R = nums.length - 1;
        while(L <= R)
        {
            int mid = (L + R) / 2;
            if(target > nums[mid])
            {
                L = mid + 1;           
            }
            else if(target < nums[mid])
            {
                R = mid - 1;
            }
            else
            {
                result = mid;
                break;
            }
            result = L;
        }
        return result;
        
    }
}