LeetCode 704. 二分查找

最新推荐文章于 2024-10-17 19:06:39 发布

PUdd

最新推荐文章于 2024-10-17 19:06:39 发布

阅读量57

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_43737395/article/details/128622579

版权

leetcode 专栏收录该内容

52 篇文章 1 订阅

订阅专栏

简单二分查找，写代码的时候出现了问题

我写的代码

class Solution {
public:
    int search(vector<int>& nums, int target) 
    {
        int front = 0, back = nums.size()-1;
        while(front + 1 < back)
        {
            int mid = (front + back)/2;
            if (nums[mid] == target)
            {
                return mid;
            }
            else if (nums[mid] < target)
            {
                front = mid;
            }
            else
            {
                back = mid;
            }
        }

        if(nums[front] == target )
            return front;
        else if(nums[back] == target)
            return back;

        return -1;

    }
};

我根据用例修改代码后，后面两个丑陋的if和else if显得很诡异，这其实是因为我front = mid 和back = mid导致的，应该用front = mid+1或者back = mid -1，并且在改正之后应该让while的判断条件变成front<=back

改善的代码

class Solution {
public:
    int search(vector<int>& nums, int target) 
    {
        int front = 0, back = nums.size()-1;
        while(front <= back)
        {
            int mid = (front + back)/2;
            if (nums[mid] == target)
            {
                return mid;
            }
            else if (nums[mid] < target)
            {
                front = mid + 1;
            }
            else
            {
                back = mid - 1;
            }
        }
        return -1;
    }
};