#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define FILENAME "/Users/ccj/Desktop/stu.txt"
typedef struct Student
{
    char name[20];
    int num;

}Student;

typedef struct LINK
{
    Student data;
    struct LINK *next;
}LINK,*pLINK;


typedef enum IsRepeat
{
    YES,
    NO
}IsRepeat;


IsRepeat checkRepeatData(pLINK head,Student stu)
{
    pLINK temp;
    for (temp=head->next; temp!=NULL; temp=temp->next)
    {
        if(temp->data.num==stu.num)
        {
            return YES;
        }
    }
    if(temp==NULL)
    {
        return NO;
    }
    return NO;
}

//創(chuàng)建鏈表（創(chuàng)建頭結(jié)點(diǎn)）
pLINK createList(pLINK head)
{
    if(head==NULL)
    {
        head=(pLINK)malloc(sizeof(LINK));
        head->next=NULL;
        
    }
    printf("鏈表創(chuàng)建成功\n");
    return head;
}


//打印數(shù)據(jù)
void printData(pLINK head)
{
    if(NULL==head)
    {
        printf("無(wú)信息可打印\n");
        return;
    }
    pLINK temp=head->next;
    printf("head-->");
    for(;temp!=NULL;temp=temp->next)
    {
        printf("[%s,%d]--->",temp->data.name,temp->data.num);
    }
    printf("NULL\n");
}

Student getData(pLINK head);

void headInsertData(pLINK head)
{

    pLINK p=(pLINK)malloc(sizeof(LINK));
    p->next=head->next;
    head->next=p;
    p->data=getData(head);
    printf("數(shù)據(jù)插入成功\n");
}

void myScanf(char *str,int size)
{
    int i=0;
    for (i=0; i<size-1; i++)
    {
        str[i]=getchar();
        if(str[i]=='\n')
        {
            break;
        }
    }
    //說(shuō)明在中途碰到了\n
    if(str[i]=='\n')
    {
        str[i]='\0';
    }
    else
    {
        str[i]='\0';
        //吸收緩存里面的殘留的字符
        while (getchar()!='\n');
    
    }
}
Student getData(pLINK head)
{
    printf("請(qǐng)輸入學(xué)生信息[姓名 學(xué)號(hào)]:");
    Student stu;
    myScanf(stu.name, 20);
    scanf("%d",&stu.num);
    getchar();
    int errorCount=0;
    while(checkRepeatData(head, stu)==YES)
    {
        errorCount++;
        if(errorCount==3)
        {
            printf("輸入錯(cuò)誤次數(shù)過(guò)多\n");
            exit(0);//結(jié)束整個(gè)程序(錯(cuò)誤碼)
        }
        printf("該學(xué)號(hào)學(xué)生已存在\n");
        printf("請(qǐng)重新輸入數(shù)據(jù)[姓名 學(xué)號(hào)]:");
        myScanf(stu.name, 20);
        scanf("%d",&stu.num);
        getchar();
    }
    return stu;
}

void tailInsertData(pLINK head)
{

    //找尾指針：最后一個(gè)節(jié)點(diǎn)的地址
    pLINK temp;
    for(temp=head;temp->next!=NULL;temp=temp->next)
    {
    
    }
    //這個(gè)循環(huán)跳出的條件：temp->next==null;
    pLINK p=(pLINK)malloc(sizeof(LINK));
    p->data=getData(head);
    temp->next=p;
    p->next=NULL;
    printf("尾部數(shù)據(jù)插入成功\n");
}

void headDeleteData(pLINK head)
{
    if(head==NULL||head->next==NULL)
    {
        printf("無(wú)信息可刪\n");
        return;
    }
    pLINK p=head->next;
    head->next=p->next;
    free(p);
    p=NULL;
    printf("刪除數(shù)據(jù)成功\n");
}

void tailDeleteData(pLINK head)
{
    if(head==NULL||head->next==NULL)
    {
        printf("無(wú)信息可刪\n");
        return;
    }
    pLINK temp;
    
    //相當(dāng)?shù)却隣顟B(tài)，等待temp->next->next==NULL;
    for (temp=head; temp->next->next!=NULL; temp=temp->next);
    pLINK p=temp->next;
    temp->next=NULL;
    free(p);
    p=NULL;
    printf("尾刪成功\n");
    
}

int getListLength(pLINK head)
{
    if(head->next==NULL)
    {
        return 0;
    }
    int count=0;
    pLINK temp=head->next;
    for(;temp!=NULL;temp=temp->next)
    {
        count++;
    }
    return count;
}



void randomInsertData(pLINK head)
{
    int length=getListLength(head);
//    printf("length=%d\n",length);
    printf("請(qǐng)輸入要插入數(shù)據(jù)的位置:");
    int index;
    scanf("%d",&index);
    getchar();
    if(index<=0||index>length+1)
    {
        printf("位置越界\n");
        return;
    }
    if(index==1)
    {
        headInsertData(head);
    }
    else if(index==length+1)
    {
        tailInsertData(head);
    }
    else
    {
        pLINK temp;
        int i=1;
        for (temp=head->next;i<index-1; temp=temp->next,i++)
        {
            
        }
        pLINK p=(pLINK)malloc(sizeof(LINK));
        p->data=getData(head);
        p->next=temp->next;
        temp->next=p;
        printf("數(shù)據(jù)插入成功\n");
        
    }
}



void insertData(pLINK head)
{
    if(head==NULL)
    {
        printf("鏈表沒(méi)有創(chuàng)建\n");
        return ;
    }
    
    int select;
    while (1)
    {
        printf("========\n");
        printf("1.頭插數(shù)據(jù)\n");
        printf("2.尾插數(shù)據(jù)\n");
        printf("3.任意位置插入數(shù)據(jù)\n");
        printf("4.返回上一層\n");
        printf("========\n");
        scanf("%d",&select);
        getchar();
        switch (select)
        {
            case 1:
                headInsertData(head);
                break;
            case 2:
                tailInsertData(head);
                break;
            case 3:
                randomInsertData(head);
                break;
            case 4:
                return;
            default:
                break;
        }
    }
}

void randomDeleteData(pLINK head)
{
    if(head->next==NULL)
    {
        printf("無(wú)信息可刪\n");
        return;
    }
    int length=getListLength(head);
    printf("請(qǐng)輸入要?jiǎng)h除數(shù)據(jù)的位置:");
    int index;
    scanf("%d",&index);
    getchar();
    if(index<=0||index>length)
    {
        printf("位置越界\n");
        return;
    }
    if(index==1)
    {
        headDeleteData(head);
    }
    else if (index==length)
    {
        tailDeleteData(head);
    }
    else
    {
        int i=1;
        pLINK temp;
        for (temp=head->next; i<index-1; temp=temp->next,i++);
        
        pLINK p=temp->next;
        temp->next=p->next;
        free(p);
        p=NULL;
        printf("刪除數(shù)據(jù)成功\n");
    }
}

void deleteData(pLINK head)
{
    if(head==NULL||head->next==NULL)
    {
        printf("沒(méi)有信息可刪\n");
        return ;
    }
    int select;
    while (1)
    {
        printf("========\n");
        printf("1.頭刪數(shù)據(jù)\n");
        printf("2.尾刪數(shù)據(jù)\n");
        printf("3.任意位置刪除數(shù)據(jù)\n");
        printf("4.返回上一層\n");
        printf("========\n");
        scanf("%d",&select);
        getchar();
        switch (select)
        {
            case 1:
                headDeleteData(head);
                break;
            case 2:
                tailDeleteData(head);
                break;
            case 3:
                randomDeleteData(head);
                break;
            case 4:
                return;
            default:
                break;
        }
    }
}


void searchData(pLINK head)
{
    if(head==NULL||head->next==NULL)
    {
        printf("無(wú)信息可查詢(xún)\n");
        return ;
    }
    int num;
    printf("請(qǐng)輸入要查詢(xún)的學(xué)號(hào):");
    scanf("%d",&num);
    pLINK temp;
    for(temp=head->next;temp!=NULL;temp=temp->next)
    {
        if(temp->data.num==num)
        {
            printf("[%s,%d]\n",temp->data.name,num);
            return;
        }
    }
    if(NULL==temp)
    {
        printf("查無(wú)此人\n");
    }
}

void changeData(pLINK head)
{
    if(head==NULL||head->next==NULL)
    {
        printf("無(wú)信息可修改\n");
        return ;
    }
    char name[20];
    printf("請(qǐng)輸入姓名:");
    myScanf(name, 20);
    pLINK temp;
    for(temp=head->next;temp!=NULL;temp=temp->next)
    {
        if(strcmp(temp->data.name, name)==0)
        {
            printf("該學(xué)生原來(lái)信息[%s,%d]\n",temp->data.name,temp->data.num);
            printf("請(qǐng)輸入要修改的信息[姓名 學(xué)號(hào)]:");
            Student stu;
            myScanf(stu.name, 20);
            scanf("%d",&stu.num);
            temp->data=stu;
            printf("修改成功\n");
            return;
        }
    }
    if(temp==NULL)
    {
        printf("查無(wú)此人\n");
    }
}

void saveData(pLINK head)
{
    if(head==NULL||head->next==NULL)
    {
        printf("無(wú)信息可保存\n");
        return;
    }
    //1.
    FILE *fp=fopen(FILENAME, "w");
    if(fp==NULL)
    {
        perror("fopen failed");
        return;
    }
    //2.
    pLINK temp;
    for (temp=head->next; temp!=NULL; temp=temp->next)
    {
        fwrite(&temp->data, sizeof(Student), 1, fp);
    }
    //3.
    fclose(fp);
    printf("保存成功\n");

}


pLINK readDataFromFile()
{
    pLINK head=(pLINK)malloc(sizeof(LINK));
    head->next=NULL;
    
    FILE *fp=fopen(FILENAME, "r");
    if(fp==NULL)
    {
        perror("fopen failed:");
        return head;
    }
    Student stu;
    while (fread(&stu, sizeof(stu), 1, fp)==1)
    {
        pLINK p=(pLINK)malloc(sizeof(LINK));
        p->data=stu;
        //先找最后一個(gè)節(jié)點(diǎn)的位置
        pLINK temp;
        for(temp=head;temp->next!=NULL;temp=temp->next);
        temp->next=p;
        p->next=NULL;
        
    }
    
    fclose(fp);
    printf("讀取數(shù)據(jù)成功\n");
    return head;
}

pLINK offList(pLINK head)
{
    pLINK first=(pLINK)malloc(sizeof(LINK));
    first->next=NULL;
    pLINK tail=first;
    while (head->next!=NULL)
    {
        pLINK min=head->next;
        pLINK minf=head;
        pLINK temp;
        for (temp=head->next; temp->next!=NULL; temp=temp->next)
        {
            if(min->data.num>temp->next->data.num)
            {
                min=temp->next;
                minf=temp;
            }
        }
        //脫鏈
        minf->next=min->next;
        
        //穿鏈
        tail->next=min;
        min->next=NULL;
        tail=tail->next;
        
    }
    free(head);
    head=NULL;
    return first;
}



void selectSort(pLINK head)
{
    pLINK i;
    for (i=head->next; i->next!=NULL; i=i->next)
    {
        pLINK j;
        pLINK min=i;
        for (j=i->next; j!=NULL; j=j->next)
        {
            if(min->data.num>j->data.num)
            {
                min=j;
            }
        }
        if(min!=i)
        {
            Student temp=min->data;
            min->data=i->data;
            i->data=temp;
        }
        
    }
    printf("排序成功\n");
    
}

void blueSort2(pLINK head)
{
    pLINK i;
    for (i=head->next; i->next!=NULL; i=i->next)
    {
        pLINK j;
        for(j=i->next;j!=NULL;j=j->next)
        {
            if(i->data.num>j->data.num)
            {
                Student temp=i->data;
                i->data=j->data;
                j->data=temp;
            }
        }
    }
    printf("排序成功\n");
}


void blueSort1(pLINK head)
{
    int i=0;
    int length=getListLength(head);
    for (i=0; i<length-1; i++)
    {
        pLINK j;
        for (j=head->next; j->next!=NULL; j=j->next)
        {
            if(j->data.num>j->next->data.num)
            {
                Student temp=j->data;
                j->data=j->next->data;
                j->next->data=temp;
            
            }
        }
    }
    printf("排序成功\n");
}

pLINK sort(pLINK head)
{
    if(head==NULL||head->next==NULL)
    {
        printf("無(wú)數(shù)據(jù)可排\n");
        return head;
    }
    int select;
    while(1)
    {
        printf("=====\n");
        printf("1.冒泡1\n");
        printf("2.冒泡2\n");
        printf("3.選擇\n");
        printf("4.脫鏈\n");
        printf("5.返回上一層\n");
        printf("======\n");
        scanf("%d",&select);
        switch (select)
        {
            case 1:
                blueSort1(head);
                break;
            case 2:
                blueSort2(head);
                break;
            case 3:
                selectSort(head);
                break;
            case 4:
                head=offList(head);
                break;
            case 5:
                return head;
            default:
                break;
        }
    }
}

int main()
{
    pLINK head=NULL;
    int select;
    while (1)
    {
        printf("=========\n");
        printf("1.創(chuàng)建鏈表\n");
        printf("2.插入數(shù)據(jù)\n");
        printf("3.刪除數(shù)據(jù)\n");
        printf("4.打印數(shù)據(jù)\n");
        printf("5.查找數(shù)據(jù)\n");
        printf("6.修改數(shù)據(jù)\n");
        printf("7.保存數(shù)據(jù)\n");
        printf("8.從文件讀取數(shù)據(jù)\n");
        printf("9.排序(小-->大)\n");
        printf("10.退出\n");
        printf("=========\n");
        scanf("%d",&select);
        getchar();//吸收\(chéng)n殘留
        switch (select)
        {
            case 1:
                head=createList(head);
                break;
            case 2:
                insertData(head);
                break;
            case 3:
                deleteData(head);
                break;
            case 4:
                printData(head);
                break;
            case 5:
                searchData(head);
                break;
            case 6:
                changeData(head);
                break;
            case 7:
                saveData(head);
                break;
            case 8:
                head=readDataFromFile();
                break;
            case 9:
                head=sort(head);
                break;
            case 10:
                return 0;
            default:
                break;
        }
    }
    return 0;
}