二分查找面试

经典的面试题：get up from where you fell.
可以使用统一的最终判决，mid计算。

int binarySearch_1(const vector<int>& nums, int val) {
	//找出最大的下标i使nums[i] == val 
	int N = nums.size();
	if (N == 0) return -1;
	int left = 0;
	int right = N-1;
	
	while(left < right-1) {
		int mid = left+(right-left)/2;
		if (nums[mid] <= val) {
			left = mid;
		} 
		else {
			right = mid;
		}
	} 
	if(nums[right] == val) {
		return right;
	}
	if(nums[left] == val) {
		return left;
	}
	return -1;
}

int binarySearch_2(const vector<int>& nums, int val) {
	//找出最小的下标i使nums[i] == val 
	int N = nums.size();
	if (N == 0) return -1;
	int left = 0;
	int right = N-1;
	
	while(left < right-1) {
		int mid = left+(right-left)/2;
		if (nums[mid] >= val) {
			right = mid;
		} 
		else {
			left = mid;
		}
	} 
	if(nums[left] == val) {
		return left;
	}
	if(nums[right] == val) {
		return right;
	}
	return -1;
}
    int search(vector<int>& nums, int target) {
        if (nums.empty()) {
            return -1;
        }
        int left = 0;
        int right = nums.size() - 1;
        while(left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] == target) {
                return mid;
            } else if (nums[mid] > target) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return -1;
    }
    
int binarySearch_3(const vector<int>& nums, int val) {
	//找出最大的下标i使nums[i] < val 
	int N = nums.size();
	if (N == 0) return -1;
	int left = 0;
	int right = N-1;
	
	while(left < right-1) {
		int mid = left+(right-left)/2;
		if (nums[mid] >= val) {
			right = mid;
		} 
		else {
			left = mid;
		}
	} 
	if(nums[right] < val) {
		return right;
	}
	if(nums[left] < val) {
		return left;
	}
	return -1;
}

int binarySearch_4(const vector<int>& nums, int val) {
	//找出最小的下标i使nums[i] > val 
	int N = nums.size();
	if (N == 0) return -1;
	int left = 0;
	int right = N-1;
	
	while(left < right-1) {
		int mid = left+(right-left)/2;
		if (nums[mid] <= val) {
			left = mid;
		} 
		else {
			right = mid;
		}
	} 
	if(nums[left] > val) {
		return left;
	}
	if(nums[right] > val) {
		return right;
	}
	return -1;
}

// 更快的方式找到第一个和最后一个target，每次都mid - 1或者mid + 1，但是需要在循环中记录等于target的位置
class Solution {
public:
    int search(vector<int>& nums, int target) {
        if (nums.empty()) {
            return 0;
        }
        int firstPos = findFirstPos(nums, target);
        if (firstPos == -1) {
            return 0;
        }
        int lastPos = findLastPos(nums, target);
        return lastPos - firstPos + 1;
    }

    int findFirstPos(const std::vector<int>& nums, int target) {
        if (nums.empty()) {
            return -1;
        }
        int left = 0;
        int right = nums.size() - 1;
        int pos = -1;
        while(left <= right) {
            int mid = left + ((right - left) >> 1);
            if (nums[mid] < target) {
                left = mid + 1;
            } else if(nums[mid] >= target) {
                right = mid - 1;
                if (nums[mid] == target) {
                    pos = mid;
                }
            }
        }
        return pos;
    }

    int findLastPos(const std::vector<int>& nums, int target) {
        if (nums.empty()) {
            return -1;
        }
        int left = 0;
        int right = nums.size() - 1;
        int pos = -1;
        while(left <= right) {
            int mid = left + ((right - left) >> 1);
            if (nums[mid] <= target) {
                left = mid + 1;
                if (nums[mid] == target) {
                    pos = mid;
                }
            } else if(nums[mid] > target) {
                right = mid - 1;
            }
        }
        return pos;
    }
};