leetcode35. Search Insert Position

最新推荐文章于 2022-04-06 16:49:21 发布

站在风口的熊

最新推荐文章于 2022-04-06 16:49:21 发布

阅读量135

点赞数

分类专栏： leetcode&poj 文章标签： leetcode

本文链接：https://blog.csdn.net/barebear007/article/details/78482034

版权

leetcode&poj 专栏收录该内容

83 篇文章 0 订阅

订阅专栏

leetcode35. Search Insert Position

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        double pos = binarySearchPos(nums,target,0,nums.size() - 1);
        return ceil(pos);
    }


        double binarySearchPos(vector<int>& nums1, double num, int start, int end) {
        int left = start, right = end, medium = 0;
        while (left<right) {
            medium = left + (right - left) / 2;
            if (nums1[medium] - num >0.4) {
                right = medium;
            }
            else if (num - nums1[medium] >0.4) {

                left = medium + 1;
            }
            else {
                return medium;
            }


        }
        double left1;
        if (nums1[left] - num<0.4 && num - nums1[left] <0.4)
            left1 = left;
        else if (nums1[left] - num>0.4) {
            left1 = left - 0.5;
        }
        else {
            left1 = left + 0.5;
        }
        return  left1;
    }
};