扑克牌顺子

题目：从扑克牌中随机抽5张牌，判断是不是一个顺子，即这5张牌是不是连续的。2-10为数字本身，A为1，J为11，Q为12，K为13，而大小王可以看成任意数字。  

思路:把数组排序，统计数组中0的个数，统计排序之后的数组相邻数字之间的空缺总数。如果空缺的总数小于或者等于0的个数，那么这个数组就是连续的；反之则不连续。最后，我们还需要注意的是，如果数组中的非0数字重复出现，则该数组不是连续的。换成扑克牌的描述方式，就是如果一副牌里含有对子，则不可能是顺子。

#include "stdafx.h"
#include <stdlib.h>

int compare(const void* arg1, const void* arg2);

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;

    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;
}

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

    if(IsContinuous(numbers, length) == expected)
        printf("Passed
");
    else
        printf("Failed
");
}

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);
}

int main()
{
    int numbers[] = {1,3,2,5,4};
    int length = sizeof(numbers) / sizeof(int);
    printf("the array number is:
");
    for(int i = 0 ;  i < length; i ++)
        printf("%d	", numbers[i]);
    printf("
");
    if(IsContinuous(numbers, length))
        printf("is Continuous.
");
    else
        printf("not Continuous.
");
        
    printf("
");
    int numbers1[] = {1,3,0,5,0};
    length = sizeof(numbers1) / sizeof(int);
    printf("the array number is:
");
    for(int i = 0 ;  i < length; i ++)
        printf("%d	", numbers1[i]);
    printf("
");
    if(IsContinuous(numbers1, length))
        printf("is Continuous.
");
    else
        printf("not Continuous.
");
        
    printf("
");
    int numbers2[] = {1,3,2,6,4};
    length = sizeof(numbers2) / sizeof(int);
    printf("the array number is:
");
    for(int i = 0 ;  i < length; i ++)
        printf("%d	", numbers2[i]);
    printf("
");
    if(IsContinuous(numbers2, length))
        printf("is Continuous.
");
    else
        printf("not Continuous.
");
}