c++实现简单链表

#include <iostream>
using namespace std;
#include <string>
struct Number
{
    int num;
    Number *next;
};
void menu();
struct Number *initnumber();
void shownumber(struct Number *head);
void freeworker(struct Number *head);
void pushnumber(struct Number *head,int n);
void deletenumber(struct Number *head,int n);
void insertnumber(struct Number *head,int k,int n);
int main()
{
    struct Number *head=initnumber();
    int choice;
    cout<<"Welcome to the number system!"<<endl;
    menu();
    while(cin>>choice)
    {
        cout<<endl;
        switch(choice)
        {
            case 1:
                int num;
                cout<<"Please enter the number you will push:>";
                cin>>num;
                pushnumber(head,num);
                menu();
                break;
            case 2:
                int num1;
                cout<<"Please enter the number you will delete behind:>";
                cin>>num1;
                deletenumber(head,num1);
                menu();
                break;
            case 3:
                int num2,num3;
                cout<<"Please enter the numbers you will insert behind and the number you will insert:>";
                cin>>num2>>num3;
                insertnumber(head,num2,num3);
                menu();
                break;
            case 4:
            	shownumber(head);
            	menu();
            	break;
            case 0:
                cout<<"Thanks for your using!"<<endl;
                exit(0);
                break;
            default:
                cout<<"Wrong choice,please enter your choice again!"<<endl;
                menu();
                break;
        }
    }
    return 0;
}
void menu()
{
    cout<<"1.Push number    2.Delete number"<<endl;
    cout<<"3.Insert number  4.Show number"<<endl;
    cout<<"0.exit"<<endl;
    cout<<"Please enter your choice:>";
}
struct Number *initnumber()
{
    struct Number *p;
    if((p=(struct Number *)malloc(sizeof(struct Number)))==NULL)
    {
        cout<<"Apply for space failure!"<<endl<<endl;
        return NULL;
    }
    p->next=NULL;
    return p;
}
void pushnumber(struct Number *head,int n)
{
    struct Number *p=new struct Number;
    if(!p)
    {
        cout<<"Apply for space failure!"<<endl<<endl;
        return;
    }
    p->next=head->next;
    p->num=n;
    head->next=p;
    return;
}
void deletenumber(struct Number *head,int n)
{
    struct Number *p;
    struct Number *prev;
    if(head->next==NULL)
        return;
    else
    {
        int i=0;
        for(prev=head,p=head->next;i<n&&p!=NULL;i++,prev=p,p=p->next);
        if(!p)
            return;
        else
        {
            prev->next=p->next;
            delete p;
            return;
        }
    }
}
void insertnumber(struct Number *head,int k,int n)
{
    struct Number *p;
    struct Number *node=new struct Number;
    if(!node)
    {
        cout<<"Apply for space failure!"<<endl<<endl;
        return;
    }
    int i=0;
    for(p=head;i<k&&p!=NULL;i++,p=p->next);
    node->num=n;
    node->next=p->next;
    p->next=node;
    return;
}
void shownumber(struct Number *head)
{
	for(struct Number *p=head->next;p!=NULL;p=p->next)
	{
		cout<<p->num<<"\t";
	}
	cout<<endl;
}
void freeworker(struct Number *head)
{
	struct Number *next;
	for(struct Number *p=head;p!=NULL;p=next)
	{
		next=p->next;
		delete p;
	}
}