44.扑克牌的顺子

把5张牌看成由5个数字组成的数组。大小王定义为0。

bool IsContinuous(int* numbers, int length)
{
if (numbers == NULL || length < 1)
return false;
qsort(numbers, length, sizeof(int), compare);
int numberOfZero = 0;
int numberOfGap = 0;
//统计数组中0的个数
for (int i = 0; i < length&&numbers[i] == 0; ++i)
++numberOfZero;
//统计数组中的间隔数目
int small = numberOfZero;
int big = small + 1;
while (big < length)
{
//两个数相等，有对子，不可能是顺子
if (numbers[small] == numbers[big])
return false;
numberOfGap += numbers[big] - numbers[small] - 1;
small = big;
++big;
}
return (numberOfGap > numberOfZero) ? false : true;
}
int compare(const void* arg1, const void* arg2)
{
return  *(int*)arg1 - *(int*)arg2;
}

44.扑克牌的顺子

原文：http://blog.csdn.net/wangfengfan1/article/details/46842783