[PTA]Week8 Sort Three Distinct Keys



　　看了很久题目也没看懂啥意思，莫名其妙就过了，我猜这大概是传说中桶排序 → →

　　

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

typedef enum { true, false, maybe } Keys;
typedef Keys ElementType;

void Read( ElementType A[], int N ); /* details omitted */

void MySort( ElementType A[], int N );

void PrintA( ElementType A[], int N )
{
    int i, k;

    k = i = 0;
    for ( ; i<N && A[i]==false; i++ );
    if ( i > k )
        printf("false in A[%d]-A[%d]\n", k, i-1);
    k = i;
    for ( ; i<N && A[i]==maybe; i++ );
    if ( i > k )
        printf("maybe in A[%d]-A[%d]\n", k, i-1);
    k = i;
    for ( ; i<N && A[i]==true; i++ );
    if ( i > k )
        printf("true in A[%d]-A[%d]\n", k, i-1);
    if ( i < N )
        printf("Wrong Answer\n");
}

int main()
{
    int N;
    ElementType *A;

    scanf("%d", &N);
    A = (ElementType *)malloc(N * sizeof(ElementType));
    Read( A, N );
    MySort( A, N );
    PrintA( A, N );
    return 0;
/* Your function will be put here */
}

void Read( ElementType A[], int N )
{
	int i;
	for(i=0;i<N;i++){
		scanf("%d",&A[i]);
	}
	return;
}

void MySort( ElementType A[], int N )
{
	int i;
	int count1,count2,count3;
	count1=count2=count3=0;
	for(i=0;i<N;i++){
		if(A[i]==false){
			count1++;
		}
		else if(A[i]==maybe){
			count2++;
		}
		else if(A[i]==true){
			count3++;
		}
	}
	for(i=0;i<count1;i++){
		A[i]=false;
	}
	for(i=count1;i<count1+count2;i++){
		A[i]=maybe;
	}
	for(i=count1+count2;i<N;i++){
		A[i]=true;
	}
	return;
}