题目:从扑克牌中随机抽5张牌,判断是不是一个顺子,即这5张牌是不是连续的。2-10为数字本身,A为1,J为11,Q为12,K为13,而大小王可以看成任意数字。
分析:把大小王定义为0,可以替换任意数字。
首先把数组排序,再统计数组中0的个数,最后统计排序之后的数组中相邻数字之间的空缺总数。
如果空缺的总数小于或等于0的个数,那么这个数组就是连续的;反之则不连续。
如果出现相邻数字相等,则不连续,对子一定不是顺子
#include<iostream>
using namespace std;
int compare(const void *a,const void *b)
{
return *(int*)a-*(int*)b;
}
bool IsContinuous(int *data,int length)
{
if(data==NULL || length<5)
return false;
qsort(data,length,sizeof(int),compare);
int zerosCount = 0;
int gapsCount = 0;
for(int i=0;i<length && data[i]==0;i++)
++zerosCount;
int small = zerosCount;
int big = small+1;
while(big<length)
{
if(data[small]==data[big])
return false;
gapsCount += data[big]-data[small]-1;
small = big;
big++;
}
return zerosCount>=gapsCount?true:false;
}
// ====================测试代码====================
void Test(char* testName, int* numbers, int length, bool expected)
{
if(testName != NULL)
printf("%s begins: ", testName);
if(IsContinuous(numbers, length) == expected)
printf("Passed.\n");
else
printf("Failed.\n");
}
void Test1()
{
int numbers[] = {1, 3, 2, 5, 4};
Test("Test1", numbers, sizeof(numbers) / sizeof(int), true);
}
void Test2()
{
int numbers[] = {1, 3, 2, 6, 4};
Test("Test2", numbers, sizeof(numbers) / sizeof(int), false);
}
void Test3()
{
int numbers[] = {0, 3, 2, 6, 4};
Test("Test3", numbers, sizeof(numbers) / sizeof(int), true);
}
void Test4()
{
int numbers[] = {0, 3, 1, 6, 4};
Test("Test4", numbers, sizeof(numbers) / sizeof(int), false);
}
void Test5()
{
int numbers[] = {1, 3, 0, 5, 0};
Test("Test5", numbers, sizeof(numbers) / sizeof(int), true);
}
void Test6()
{
int numbers[] = {1, 3, 0, 7, 0};
Test("Test6", numbers, sizeof(numbers) / sizeof(int), false);
}
void Test7()
{
int numbers[] = {1, 0, 0, 5, 0};
Test("Test7", numbers, sizeof(numbers) / sizeof(int), true);
}
void Test8()
{
int numbers[] = {1, 0, 0, 7, 0};
Test("Test8", numbers, sizeof(numbers) / sizeof(int), false);
}
void Test9()
{
int numbers[] = {3, 0, 0, 0, 0};
Test("Test9", numbers, sizeof(numbers) / sizeof(int), true);
}
void Test10()
{
int numbers[] = {0, 0, 0, 0, 0};
Test("Test10", numbers, sizeof(numbers) / sizeof(int), true);
}
// 有对子
void Test11()
{
int numbers[] = {1, 0, 0, 1, 0};
Test("Test11", numbers, sizeof(numbers) / sizeof(int), false);
}
// 鲁棒性测试
void Test12()
{
Test("Test12", NULL, 0, false);
}
int main(int argc, char* argv[])
{
Test1();
Test2();
Test3();
Test4();
Test5();
Test6();
Test7();
Test8();
Test9();
Test10();
Test11();
Test12();
return 0;
}