有序数组中某个数字的出现次数

有序数组中某个数字的出现次数

c++

二分查找 特殊情况处理

#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int target;
	cin >> target;
	vector<int> input = {2, 2};
//	int s;
//	while (cin >> s) {
//		input.push_back(s);
//	}	
	//cout << target << endl;
	int l = 0, r = input.size() - 1;
	while (l <= r) {
		int mid = l + (r - l) / 2;
		if (input[mid] == target && (mid == 0 || input[mid - 1] != target)) {
			l = mid;
			break;
		}
		if (input[mid] >= target) {
			r = mid - 1;
		}
		else {
			l = mid + 1;
		}
	}
	int start = l;
	l = 0;
	r = input.size() - 1;
	while (l < r) {
		int mid = l + (r - l) / 2;
		if (input[mid] == target && (mid == input.size() - 1 || input[mid + 1] != target)) {
			l = mid;
			break;
		}
		if (input[mid] > target) {
			r = mid - 1;
		}
		else {
			l = mid + 1;
		}
	}
	if (input[start] != target || input[l] != target) {
		cout << "Error in input" << endl;
		return -1;
	}
	int output = l - start + 1;
	cout << output << endl;
	return 0;
}

仅作记录，如有问题请指正