剑指offer 面试题38 排序数组中数字出现的次数

#include <iostream>
using namespace std;
int GetFirstK(int* num,int len,int start,int end,int k){
	//no k exist in num
	if(start>end) return -1;
	//modify start/end or just return the result
	int mid=(start+end)/2;
	if(num[mid]==k){
		if(mid==0||num[mid-1]<k) return mid;
		else end=mid-1;
	}
	else if(num[mid]>k)
			end=mid-1;
		else
			start=mid+1;
	return GetFirstK(num,len,start,end,k);
}
int GetLastK(int* num,int len,int start,int end,int k){
	if(start>end) return -1;
	int mid=(start+end)/2;
	if(num[mid]==k){
		if(mid==end||num[mid+1]>k) return mid;
		else start=mid+1;
	}
	else if(num[mid]>k)
			end=mid-1;
		else
			start=mid+1;
	return GetLastK(num,len,start,end,k);
}
int GetNumOfK(int* num,int len,int k){
	if(!num || len<=0)
		return 0;
	int first,last;
	first=GetFirstK(num,len,0,len-1,k);
	last=GetLastK(num,len,0,len-1,k);
	//no k exist in num
	if(first==-1||last==-1) return 0;
	return last-first+1;
}
int main(){
	int num[]={1,1,1,2,2,2,2,3,3,4,5,5,5,5,5,6,6,6,6,6,6};
	for(int i=0;i<7;++i){
		cout<<GetNumOfK(num,sizeof(num)/sizeof(*num),i)<<' ';
	}
}