#include<iostream>
#include<string>
#include<fstream>
using namespace std;
int countNum(int a[], int value, int start, int end)
{
int count = 0;
int middle = (start + end) / 2;
if (start>end)
return 0;
if (a[middle] == value)
{
count = 1;
count +=countNum(a, value,start, middle - 1);
count +=countNum(a, value,middle + 1, end);
return count;
}
else if (a[middle] < value)
{
count += countNum(a, value, middle + 1, end);
}
else
{
count += countNum(a, value, start, middle - 1);
}
}
int main()
{
int count = 0;
int a[] = { 1, 2, 2, 2, 3, 4 ,4,4,4,6,7,8};
count = countNum(a, 9, 0, 11);
cout << "9 count is " << count << endl;
system("pause");
return 0;
}
给定一个排好序的数组,从里面查找一个给定值出现的次数
最新推荐文章于 2022-04-10 16:41:54 发布