剑指offer 面试题44 扑克牌顺子

#include <stdio.h>
#include <stdlib.h>
int compare(const void* a,const void* b){
	return *(int*)a-*(int*)b;	
}
bool IsContinuous(int* num,int len){
	if(!num||len<=0) return false;
	qsort(num,len,sizeof(int),compare);
	int zeronum=0;
	for(int i=0;num[i]==0 && i<len;++i)
		zeronum++;
	int gap=0;
	for(int i=zeronum;i<len-1;++i){
		if(num[i]==num[i+1])
			return false;
		if(num[i]+1==num[i+1])
			continue;
		else
			gap+=num[i+1]-num[i]-1;
	}
	if(zeronum>=gap)
		return true;
	else
		return false;
}
int main(){
	int num1[]={2,3,5,6,0};
	int num2[]={2,3,6,7,0};
	int num3[]={2,3,6,7,0,0};
	int num4[]={2,3,7,8,0,0};
	int num5[]={1,2,3,4,5};
	int num6[]={1,2,3,4,6};
	int num7[]={1,2,3,4,4};
	printf("%d%d%d%d%d%d%d",IsContinuous(num1,sizeof(num1)/sizeof(*num1))
	           ,IsContinuous(num2,sizeof(num2)/sizeof(*num2))
			   ,IsContinuous(num3,sizeof(num3)/sizeof(*num3))
			   ,IsContinuous(num4,sizeof(num4)/sizeof(*num4))
			   ,IsContinuous(num5,sizeof(num5)/sizeof(*num5))
			   ,IsContinuous(num6,sizeof(num6)/sizeof(*num6))
			   ,IsContinuous(num7,sizeof(num7)/sizeof(*num7))
			   ,IsContinuous(NULL,sizeof(num2)/sizeof(*num2)));
}