oral_quiz-#扑克牌是不是顺子#

#include <stdio.h>
#include <stdlib.h>

bool IfHavePair(int* cards, int length);
int compare(const void* arg1, const void* arg2);
bool IsContinous(int* cards, int length) {
	if(cards == NULL || length < 1)
		return false;
	//我们知道，length<=10的情况下，insSort的效率是最高的，
	//但是为了可扩展，还是用了stl的qsort

	qsort(cards, length, sizeof(int), compare);

	int numberOfZero = 0;
	int numberOfGap = 0;

	for(int i=0; i<length; ++i) {
		if(cards[i] == 0)
			numberOfZero++;
		else if(i<length-1)
			numberOfGap += cards[i+1]-cards[i]-1;
	}

	return !IfHavePair(cards, length) && numberOfZero >= numberOfGap ? true : false;
}

bool IfHavePair(int* cards, int length) {
	bool bHave = false;
	for(int i=0; i<length-1; ++i)
		if(cards[i] && cards[i+1] == cards[i]) {	//是大小王的话就不用比了
			bHave = true;
			break;
		}

	return bHave;
}

int compare(const void* arg1, const void* arg2) {
	return *(int*)arg1 - *(int*)arg2;
}

// ====================测试代码====================
void Test(const char* testName, int* numbers, int length, bool expected)
{
    if(testName != NULL)
        printf("%s begins: ", testName);

    if(IsContinous(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;
}