力扣704二分查找

力扣题目链接：704. 二分查找 - 力扣（LeetCode）

c++版代码：

左闭右闭代码：

因为left和right都有意义,遍历区间为[left , right]所以当 nums[mid] != target 时 left 和 right 需要作+1-1操作

class Solution {
public:
	int search(vector<int>& nums, int target) {
		int left = 0;
		int right = nums.size() - 1;
		while (left<=right)//因为left和right都有意义,所以用<=
		{
			int mid = left + (right - left) / 2;//用"(right - left) / 2"防止溢出
			if (nums[mid] < target) left = mid + 1;
			else if (nums[mid] > target)right = mid - 1;
			else return mid;
		}
		return -1;//没找到target返回-1
	}
};

左闭右开代码：

因为遍历区间为[left , right),nums[mid] > target 时 right = mid,因为下一次循环不会搜索到nums[right] 这里了

class Solution {
public:
	int search(vector<int>& nums, int target) {
		int left = 0;
		int right = nums.size();
		while (left < right)//因为left==right时在(left,right]上无意义,所以用<
		{
			int mid = left + (right - left) / 2;//用"(right - left) / 2"防止溢出
			if (nums[mid] < target) left = mid + 1;
			else if (nums[mid] > target)right = mid;
			else return mid;
		}
		return -1;//没找到target返回-1
	}
};

左闭右开代码的递归实现：

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

java版左闭右闭代码：

class Solution {
    public int search(int[] nums, int target) {
        int left=0;
        int right=nums.length-1;
        while (left<=right){
            int mid=left+(right-left)/2;
            if(nums[mid]<target)left=mid+1;
            else if(nums[mid]>target)right=mid-1;
            else return mid;
        }
        return -1;
    }
}

参考：https://www.programmercarl.com/0704.%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.html#%E7%AE%97%E6%B3%95%E5%85%AC%E5%BC%80%E8%AF%BE

初学者，见解不足，如有错误请指出