Leetcode 35. Search Insert Position

アプローチ

二分探索

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

            } else {
                high = mid - 1;
                result = mid;               
            }

        }
        return result;
    }
}