扑克排序

#include 
#include 
using namespace std;
int IsPairFive(int *number,int length)
{
    if(number==NULL||length<1)
        return 0;
    int flag[14]={0};
    int NumZero=0;
    int numOther=0;
    for(int i=0;i<5;i++)
    {
        flag[number[i]]++;
        if(flag[number[i]]>1&&number[i]>0)return 0;
    }
    int k=1;
    while(flag[k]==0)
        k++;
    printf("%d\n",k);
    int cont=k+5;
    for(;k<=13&&k

转载于:https://www.cnblogs.com/xiaofeiwang/p/3825013.html

你可能感兴趣的:(扑克排序)