数据结构 链式表

 

　　数据结构课作业之链式表。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

struct Node
{
    char name[30];
    char telp[30];
    Node * next;
};

class Stulist
{
    public :
        Stulist ();
        ~Stulist ();

        void Creat (int n);   //建立n个元素的链式表

        void Insert (Node item, int pos);//按位置插入元素item

        void Find (int pos) const; //按位置查找

        void Delete (int pos); //按位置删除

        void Print () const;  //打印所有数据
 
        void Clear ();   //清空链式表
    private :
        Node * first;
};

void Stulist :: Clear ()
{
    Node * Pre = first;
    while (Pre)
    {
        memset (Pre->name, 0, sizeof Pre->name);
        memset (Pre->telp, 0, sizeof Pre->telp);
        Pre = Pre->next;
    }
}

void Stulist :: Print () const
{
    Node * Pre = first->next;
    int cnt=1;
    cout << "******************************\n";
    while (Pre)
    {
        cout <<"    "<< cnt <<".  "<< Pre->name << "   " << Pre->telp << endl;
        Pre = Pre->next;
        cnt++;
    }
    cout << "******************************\n";
}

void Stulist :: Delete (int pos)
{
    Node * Pre = first;
    int cnt=0;
    cout << "请输入要删除的位置: "; cin >> pos;
    while (Pre && cnt<pos-1)
    {
        Pre = Pre->next;
        cnt++;
    }
    if (Pre==NULL)
    {
        cout << "试图删除非法位置!\n";
        return;
    }
    Pre->next = Pre->next->next;
    cout << "以成功删除第" << pos << " 个数据.\n";
}

void Stulist :: Find (int pos) const
{
    Node * Pre = first;
    int cnt=0;
    cout << "请输入要查找的位置: "; cin >> pos;
    while (Pre && cnt<pos)
    {
        Pre = Pre->next;
        cnt++;
    }
    if (Pre==NULL)
    {
        cout << "你要查找的数据不存在，请核对后再查找!\n";
        return;
    }
    cout << "你要查找的信息详细如下：\n";
    cout << "************************\n";
    cout << " 姓名："<< Pre->name <<endl;
    cout << " 号码："<< Pre->telp <<endl;
    cout << "************************\n";
}

void Stulist::Insert (Node item, int pos)
{
    Node * Pre=first, * Cur;
    cout << "请输入要插入的位置: "; cin >> pos;
    int cnt=0;
    while (Pre && cnt < pos-1)
    {
        Pre = Pre->next;
        cnt++;
    }
    if (Pre==NULL)
    {
        cout << "试图插入非法位置!\n";
        return;
    }
    cout << "请出入要插入的姓名："; cin >> item.name;
    cout << "请出入要插入的号码："; cin >> item.telp;
    Cur = new Node;
    strcpy (Cur->name, item.name);
    strcpy (Cur->telp, item.telp);
    Cur->next = Pre->next;
    Pre->next = Cur;
    cout << "插入成功！\n";
}

Stulist::Stulist ()
{
    first = new Node;
    first->next = NULL;
}

Stulist :: ~Stulist ()
{
    Node * pre = first;
    while (first)
    {
        pre = first;
        first = pre->next;
        delete pre;
    }
}
void Stulist::Creat (int n)
{
    Node *Pre, *Cur;
    first = new Node;
    Pre = first;
    cout << "请输入要建立表的大小: "; cin >> n;
    for (int i=0; i<n; i++)
    {
        Cur = new Node;
        cout << "请输入第 " << i+1 << " 个数据："; cin >> Cur->name >> Cur->telp;
        Pre->next = Cur;
        Pre = Cur;
    }
    Pre->next = NULL;
}

void Meue ()
{
    cout<<" \n ~~~~~~~~~~~~~~请选择您要执行的操作：~~~~~~~~~~~~~~\n"; 
    cout<<endl<<endl; 
    cout<<" `````````````````````````````````````````````\n"; 
    cout<<" ` 1、清空顺序表 `\n"; 
    cout<<" ` 2、创建顺序表 `\n"; 
    cout<<" ` 3、插入信息 `\n"; 
    cout<<" ` 4、删除信息 `\n"; 
    cout<<" ` 5、查找信息 `\n"; 
    cout<<" ` 6、显示当前信息 `\n"; 
    cout<<" ` 0、退出系统 `\n"; 
    cout<<" `````````````````````````````````````````````\n"; 
    cout<<"\n请从序号0--6中选择:"; 
}

void Operater (Stulist &Link)
{
    Meue ();
    int op, pos, n;
    Node item;
    while (1)
    {
        while (cin >> op, (op<0||op>6)) cout << "操作不合法:    \n";
        switch (op)
        {
            case 1:
                Link.Clear (); break;
            case 2:
                Link.Creat (n); break;
            case 3:
                Link.Insert (item, pos); break;
            case 4:
                Link.Delete (pos); break;
            case 5:
                Link.Find (pos); break;
            case 6:
                Link.Print (); break;
            default:break;
        }
    }
    cout << "~~~~~~~~~欢迎下次使用~~~~~~~~~\n";
}


//***************         主程序         **************
int main ()
{
    Stulist Link;

    Operater (Link);

    return 0;
}