Queue 응용

Queue 응용

 
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define EMPTY 0
 
 
typedef struct Linkedlist{
    int number;
    struct Linkedlist *link;
    struct Studentlist *datalink;
}queue;
 
typedef struct Studentlist{
    char name[20];
    int kor, eng, math;
}Student;
 
queue * Initial_queue(){
    queue *tmp = (queue*)malloc(sizeof(queue));
    tmp->link = NULL;
    return tmp;
}
 
Student * Initial_Stu(){
    Student *tmp = (Student*)malloc(sizeof(Student));
    return tmp;
}
 
Student * Input_data(Student * stu) {
    printf("이   름 : ");
    scanf("%s", stu->name);
    fflush(stdin);
    printf("국어점수 : ");
    scanf("%d", &(stu->kor));
    fflush(stdin);
    printf("수학점수 : ");
    scanf("%d", &(stu->math));
    fflush(stdin);
    printf("영어점수 : ");
    scanf("%d", &(stu->eng));
    fflush(stdin);
 
    return stu;
}
 
queue * find_rear(queue **front){
    queue * tmp;
    tmp = *front;
    if ((*front)->link == NULL)
    {
        return tmp;
    }
    else
    {
        tmp = tmp->link;
        return find_rear(&tmp);
    }
}
 
 
void Add_queue(queue **front){
    static int num = 0;
    queue * tmp;
    queue * rear = Initial_queue();
 
    rear->datalink = Initial_Stu();
    rear->datalink = Input_data(rear->datalink);
    rear->number = num + 1;
    if (*front == NULL) {
        *front = rear;
    }
    else {
        tmp = find_rear(front);
        tmp->link = rear;
    }
 
    num++;
}
queue * Print_queue(queue **front){
    queue *tmp = *front;
    queue * returnval = EMPTY;
    if (*front == EMPTY)
    {
        printf("학생이 입력되지 않았습니다.\n\n");
        return tmp;
    }
    else if (tmp->number != 1)
    {
        printf("%d\t%s\t%d\t%d\t%d\n", tmp->number, tmp->datalink->name, 
                  tmp->datalink->kor, tmp->datalink->eng, tmp->datalink->math);
        if (tmp->link != NULL)
        {
            return Print_queue(&(tmp->link));
        }
        return returnval;
    }
    else
    {
        printf("%d\t%s\t%d\t%d\t%d\n", tmp->number, tmp->datalink->name,
                  tmp->datalink->kor, tmp->datalink->eng, tmp->datalink->math);
        return Print_queue(&(tmp->link));
    }
}
 
 
int main(int argc, char *argv[]){
    queue *front = NULL;
    int select;
 
    while (1){
        printf("==================\n");
        printf(" 학생관리프로그램\n");
        printf("==================\n");
        printf(" 1.학생등록\n");
        printf(" 2.학생정보\n");
        printf(" 3.종료\n");
        printf(" 선택 : ");
        scanf("%d", &select);
        fflush(stdin);
 
        if (select >= 1 && select <= 4){
 
            switch (select){
            case 1: //등록
                system("cls");
                Add_queue(&front);
                system("pause"); system("cls");
                break;
 
            case 2: //보기
                system("cls");
                printf("번호\t이름\t국어\t영어\t수학\n");
                Print_queue(&front);    printf("\n");
                //test(&front);
                system("pause"); system("cls");
                break;
            case 3: //종료
                printf("프로그램을 종료 합니다.\n");
                exit(0);
                break;
            }
        }
        else
        {
            printf("잘못된 선택입니다\n");
            system("pause");
            system("cls");
        }
    }
    return 0;
}