xmuC语言程序实践week 3 大作业

#include<bits/stdc++.h>
#define rg register long long
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 5005
const double eps=1e-8;
using namespace std;
typedef int Elemtype;
typedef struct LNode
{
    Elemtype data;
    struct LNode* next;
} LNode, *LinkList;
inline ll read()
{
    char ch=getchar();
    ll s=0,w=1;
    while(ch<48||ch>57)
    {
        if(ch=='-')
            w=-1;
        else
        {
            cout<<"Input Error!"<<endl;
            return inf;
        }
        ch=getchar();
    }
    while(ch>=48&&ch<=57)
    {
        s=(s<<1)+(s<<3)+(ch^48);
        ch=getchar();
    }
    return s*w;
}
inline void write(ll x)
{
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        write(x/10);
    putchar(x%10+48);
}
ll n;
inline void Display(LinkList L)
{
    LinkList p=L->next;
    //cout<<p->data<<endl;
    while(p)
    {
        p->next==NULL?cout<<p->data:cout<<p->data<<" ";
        p=p->next;
    }
    cout<<endl;
}
inline void Sort(LinkList &L)
{
    LinkList p, p1, q, pre;
    if (L->next != NULL)
    {
        p = L->next->next;
        L->next->next = NULL;
        while (p != NULL)
        {
            pre = L;  //pre指向q的前驱
            q = pre->next;
            while (q != NULL&&q->data < p->data)//从链表第二个结点开始找比当前插入值大的结点
            {
                pre = q;
                q = q->next;
            }
            p1 = p->next;//将p插入到结点pre和p之间
            p->next = pre->next;
            pre->next = p;
            p = p1;
        }
    }
}
inline void List_insert(LinkList &L,ll index)
{
    LinkList p=L;
    while(p->next!=NULL)
    {
        p=p->next;
    }
    LinkList temp=(LinkList)malloc(sizeof(LNode));
    temp->data=index;
    temp->next=NULL;
    //cout<<temp->data<<endl;
    p->next=temp;
    //cout<<p->next->data<<endl;
    //Display(L);
    //Display(L);
    //cout<<"a"<<endl;
    //free(temp);
}
inline ll Search_pos(LinkList &L,ll index)
{
    if(L->next==NULL)return 0;
    ll ans=0,flag=0;
    LinkList p=L->next;
    while(p)
    {
        ans++;
        if(p->data==index)
        {
            flag=1;
            return ans;
        }
        p=p->next;
    }
    return flag==1?ans:0;
}
inline void Delete_index(LinkList &L,ll index)
{
    LinkList p=L->next,pre=L;
    while(p)
    {
        if(p->data==index)
        {
            pre->next=p->next;
            free(p);
            return ;
        }
        pre=p;
        p=p->next;
    }
    return ;
}
inline void work()
{
    while(1)
    {
        cout<<"please input numbers of figures:";
        n=read();
        if(n<=1024&&n>0)
            break;
        if(n>1024)
        {
            cout<<"Too many!"<<endl;
            return ;
        }
    }
    LinkList L;
    L = (LinkList)malloc(sizeof(LNode));
    L->next=NULL;
    cout<<"Input begin:"<<endl;
    for(rg i=0; i<n; i++)
    {
            ll index=read();
            if(index==inf)  return ;
            if(index>=0)
            {
                if(index==0)
                {
                    cout<<"Insert failed,another try!"<<endl;
                    i--;
                    continue;
                }
                //cout<<index<<endl;
                List_insert(L,index);
                //Display(L);
                Sort(L);
                cout<<"Insert Position:"<<Search_pos(L,index)<<endl;
                cout<<"Current Sequence:";
                Display(L);
            }
            else if(index<0)
            {
                index*=-1;
                //cout<<index<<endl;
                if(Search_pos(L,index))
                {
                    cout<<"Delete Position:"<<Search_pos(L,index)<<endl;
                    Delete_index(L,index);
                    cout<<"Current Sequence:";
                    Display(L);
                }
                else
                    cout<<"Not found,delete failed,another try!"<<endl;
            }
    }
    cout<<"All is done!"<<endl;
}
int main()
{
    work();
    return 0;
}