暗黑计划-打牌

将输入字符串变成整数数组

int change(char a[10],int a1[10])
{
    int i,j;
    for(i=0,j=0;a[i];i++){
            if(a[i] == '1'){
                a1[j++] = 10;
                i++;
                //continue;
            }
            else if(a[i]>='2' && a[i]<='9'){
                a1[j++] = a[i]-'0';
            }else{
                switch(a[i]){
                    case 'J':a1[j++] = 11;break;
                    case 'Q':a1[j++] = 12;break;
                    case 'K':a1[j++] = 13;break;
                    case 'A':a1[j++] = 14;break;
                    default :return -1;
                }
            }
       }
       return j;
}

输入方式。

char a[10],b[10];
 
    while(scanf("%s %s",&a,&b)!=EOF){
 
        len1 = change(a,a1);
        len2 = change(b,b1);
        //printf("%d %d\n",len1,len2);
        if(len1<3 || len1>3 || len2<3 || len2>3){
            printf("-2\n");
            continue;
        }
 
        sort(a1,a1+3);//这个竟然可以用sort
        sort(b1,b1+3);