一个链表类 大成时应该做成模板类的

总结就是一句话：还没写完 

所以各位看官如果觉得写得不堪入目，我在这给您道歉了~~~

代码在codeblocks上调试通过

已定义的函数都能正常使用。

目前还没发现别的什么bug，如果有发现，还望指正~~~

/************START****************/

#include <iostream>
#include <cstdlib>
#define badswap(a,b) {(a)+=(b);(b)=(a)-(b);(a)=(a)-(b);}
#define swap(a,b) if(&a==&b);else{(a)+=(b);(b)=(a)-(b);(a)=(a)-(b);}
//The bug of it is if a and b is the same one value,it will be zero
//the uper define has risk to overflow
//but I think it OK now
/*
Bug correct
At the CreatList function,I think it's better for me to use
new form to deal with list creating
*/
using namespace std;

typedef struct Item
{
    int num;
    Item *next;
    //wait to be added in new elements
}item;
class List
{
    private:
            item *head,*last,*pointer;
            int maxsize;
            int presize;
            int prelocation;//present location
            //
    public:
            List(int max=10);
            List(const List &);
            bool CreatList();
            bool insert(const item &it,int position);//two arguments is needed
            item* search(item)const;//no implementation
            bool sort();//finished
            void show()const;
            ~List();
            //friend istream &operator>>(istream & is,List )
            //It seems to be a little difficult to do this,so canceled temporary
};
List::List(int max)
{
    head=last=pointer=NULL;
    maxsize=max;
    presize=0;
    prelocation=0;
}
List::List(const List &Another_L)//There is some problem in it~~~
{
    cout<<"working~"<<endl;
    if(Another_L.head==NULL)
        abort();
    item *current,*pre,*Ahead=Another_L.head;
    head=NULL;
    while(Ahead!=NULL)
    {
        if(head==NULL)
        {
            head=new item;
            if(head==NULL)
                abort();
            head->num=Ahead->num;
            pre=head;
            Ahead=Ahead->next;
            presize++;
            continue;
        }
        current=new item;
        if(current==NULL)
            abort();
        //checked that it's OK
        current->next=NULL;//next initial
        pre->next=current;//lingking~~~
        pre=current;//save present pointer
        //I think I am right to do so when there is no pointer in Item
        *current=*Ahead;
        //~~~~~~~~~~~~~~
        Ahead=Ahead->next;
        //finished
    }
    cout<<"Copy constructor is finished\n";
}
bool List::CreatList()
{
    item *current,*pre;
    int inttemp;
    cout<<"This List support int Only now~~\n";
    head=new item;
    if(head==NULL)
        return false;
    pre=head;
    pre->next=NULL;
    cin>>pre->num;
    if(cin.fail())
    {
        delete head;
        head=NULL;
        cout<<"Wrong input\n";
        return false;
    }
    //cout<<maxsize<<endl;
    presize++;//number counter
    while(presize<maxsize)
    {
        cin>>inttemp;
        if(cin.fail())
            break;
        current=new item;
        if(current==NULL)
            return false;
        current->num=inttemp;
        pointer=pre;//signal
        pre->next=current;
        pre=current;
        current->next=NULL;
        presize++;
        //cin>>current->num;
    }
    return true;
}
bool List::insert(const item &it,int position)//insert function
{
    item *temp=head,*pre;
    if(position>presize)
    {
        cout<<"there is no position to add"<<endl;
        return false;
    }
    for(int i=1;i<position;i++)
    {
        pre=temp;
        temp=temp->next;
    }
    pre->next=new item;
    if(pre->next==NULL)
    {
        pre->next=temp;
        return false;
    }
    *(pre->next)=it;
    pre->next->next=temp;
    return true;
}
void List::show()const
{
    item *temp;
    temp=head;
    cout<<"Present size of the List: "<<presize<<endl;
    while(temp!=NULL)
    {
        cout<<temp->num<<ends;
        temp=temp->next;
    }
    cout<<endl;
}
bool List::sort()
{
    item *pointer=head;//initial
    item *swappointer,*waittoswap;
    if(pointer==NULL)
        return false;
    if(presize==1)
    {
        cout<<"there is olny one valid value in the list\n";
        return true;
    }
    //temp data
    int max;//used to sign the max number in the list
    //save the present infomation
    waittoswap=pointer;
    max=pointer->num;
    swappointer=pointer;
    //used for swap
    //the uper part has no problem;
    //this part can find the maxnumber in the list
    while(waittoswap->next!=NULL)
    {
        max=pointer->num;
        while(pointer->next!=NULL)
        {
            if(max<pointer->next->num)
            {
                max=pointer->next->num;
                swappointer=pointer->next;
            }
            pointer=pointer->next;//tempswap and pointer must be the same position at the beginning
        }
        //show();
        cout<<max<<endl;
        swap(waittoswap->num,swappointer->num);
        waittoswap=waittoswap->next;
        //this is used to initial the present pointer
        //it's very important
        pointer=waittoswap;
        swappointer=waittoswap;
    }
    return true;
    //
}
List::~List()
{
    item *temp;
    temp=head;
    while(temp!=NULL)
    {
        //cout<<temp->num<<ends;
        head=temp->next;
        delete temp;
        temp=head;
    }
    //abort();
    cout<<"\ndestructor is finished\n";
}
int main()
{
    cout << "Hello world!" << endl;
    List temp;
    temp.CreatList();
    temp.sort();
    temp.show();
    return 0;
}
    //insert test psrt
    //item asd={99,NULL};
    //temp.CreatList();
    //temp.show();
    //temp.insert(asd,10);
    //temp.show();
    /*int a=0xFFFFFFFF,b=12345;
    swap(a,b);
    cout<<(int*)a<<ends<<b<<ends;
    */
    /*cin>>a;
    if(cin.fail())
    cout<<"can't read\n";
    else
    cout<<"can read\n";*/
    //int a;
    /*
        insidec=count;
        while((insidec--)>1)
            {
                if(swaptemp>pointer->next->num)
                {
                    swaptemp=pointer->next->num;
                }
                pointer=pointer->next;
                cout<<pointer->next->num<<ends;
            }
        swap(swaptemp,swappointer->num);
        pointer=head;
        swappointer=pointer;
        */
//#define swap1(a,b) {(a)+=(b);(b)=(a)-(b);(a)=(a)-(b);}

新添加了sort函数，排除了CreatList中的Bug。

另外新发现了一个这里的宏定义Bug