zoukankan      html  css  js  c++  java
  • 扑克排序

    #include <iostream>
    #include <stdio.h>
    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
    ",k);
        int cont=k+5;
        for(;k<=13&&k<cont;k++)
        {
            if(flag[k]==0)
                NumZero++;
            else
                if(flag[k]==1)
                numOther++;
        }
        printf("%d %d %d
    ",numOther,flag[0],NumZero);
        if(NumZero<=flag[0]&&numOther+flag[0]==5)
        return 1;
        return 0;
    }
    int main()
    {
        int *number={0};
        if(IsPairFive(number,5)==1)
        {
            printf("YES
    ");
        }
        else
            printf("NO
    ");
        return 0;
    }
    

  • 相关阅读:
    MobileNet V1 V2
    异常检测 与 One Class SVM
    异常检测
    图像分割
    1x1卷积核的作用
    迁移学习
    python
    图像分割
    图像分割
    Nagios
  • 原文地址:https://www.cnblogs.com/xiaofeiwang/p/3825013.html
Copyright © 2011-2022 走看看