实现带有重复元素的二分查找,如果查找的元素重复,返回重复元素的起始位置。
#include <iostream>
#include <vector>
using namespace std;
class Solution{
public:
int binarySearch(vector<int> & array, int target){
if(array.size() == 0)
return -1;
else if(array.size() == 1)
return 0;
else{
int low = 0, high = array.size() - 1;
int mid = 0;
while(low < high && low < array.size() && high >= 0){
mid = (low + high) / 2;
if(array[mid] == target && (mid == 0 || array[mid - 1] != target)){
return mid;
}
else if(array[mid] >= target)
high = mid - 1;
else
low = mid + 1;
}
}
return -1;
}
};
int main() {
cout << "test\n";
int arrayTemp[] = {1,2,3,3,5,6,6,6,8,10};
vector<int> array(arrayTemp,arrayTemp + 10);
Solution sol;
int result = sol.binarySearch(array,3);
if(result == -1)
cout << "fail to find" << endl;
else
cout << result << endl;
return 0;
}