本文主要是介绍二分查找C++，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

二分查找C++

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

力扣.

这篇关于二分查找C++的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！