zoukankan      html  css  js  c++  java
  • leetCode-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.

    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 1:

    Input: [1,3,5,6], 0 
    Output: 0

    我的版本(递归二分):

    class Solution {
        public int searchInsert(int[] nums, int target) {
            if(target > nums[nums.length - 1]){
                return nums.length;
            }else if(target < nums[0]){
                return 0;
            }
            return binarySearch(nums,0,nums.length -1,target);
        }
        int binarySearch(int[]nums,int first,int last,int target){
            int medium = (first + last) / 2;
            if(first == medium && nums[medium] != target){
                return first + 1;
            }
            if(target == nums[medium]){
                return medium;
            }
            if(target > nums[medium]){
                first = medium;
            }
            if(target < nums[medium]){
                last = medium;
            }
            return binarySearch(nums,first,last,target);
        }
    }

    改进版本(非递归二分):

    class Solution {
        public int searchInsert(int[] nums, int target) {
            if (nums.length == 0) {
                return 0;
            }
            if (target > nums[nums.length - 1]) {
                return nums.length;
            }
            if (target < nums[0]) {
                return 0;
            }
    
            int start = 0; 
            int end = nums.length - 1;
            while (start < end - 1) {
                int mid = start + (end - start) / 2;
                if (nums[mid] < target) {
                    start = mid;
                } else {
                    end = mid;
                }
            }
    
            if (nums[start] == target) {
                return start;
            } else {
                return end;
            }
        }
    }
  • 相关阅读:
    Golang的安装包方法
    Debian kvm网络配置
    Debian-Linux配置网卡网络方法
    KVM虚拟机网络配置 Bridge方式,NAT方式
    WebRTC之框架与接口
    WebRTC
    关于golang.org/x包问题
    http内网转发
    linux服务器可以访问IP访问不了域名地址
    golang--生成某区间的随机数
  • 原文地址:https://www.cnblogs.com/kevincong/p/7803407.html
Copyright © 2011-2022 走看看