数据结构-------单链表（C++）

相关信息：

---

 /**

  * @subject 数据结构   实验2
  * @author 信管1142班   201411671210  赖俊杰
  * @project   单链表
  * @time 2015年10月29日16:09:34
  */

---

节点类：

---

//Node.h

template<typename DataType>
class Node
{
public:

    DataType data_;
    Node<DataType> *next_;
};

---

链表类：

---

 //  LinkList.h

 #include<iostream>
 #include"Node.h"

 using std::cout;
 using std::endl;

 template <typename DataType>
 class LinkList
 {
 public:
     LinkList();  //建立只有头节点的空链表
     LinkList(DataType a[], int n);    //建立有n个元素的单链表
     ~LinkList();

     int Length();
     DataType Get_value(int serial_number);   //在单链表中查找序号为serial_number的元素
     int Locate_serial_number(DataType value);   //查找值为value的元素序号
     void insert(int i, DataType value);         //在第i个位置插入值为value的元素
     DataType delete_value(int serial_number);     //删除序号为serial_number的元素
     void PrintList();

 private:
     Node<DataType>*first_;

 };

 template<typename DataType>
 inline LinkList<DataType>::LinkList()
 {
     first_ = new Node;
     first_->next_ = ;
 }

 template<typename DataType>
 inline LinkList<DataType>::LinkList(DataType a[], int n)
 {

     first_ = new Node<DataType>;
     Node<DataType> *r = first_;
     for (int i = ; i < n; ++i)
     {
         Node<DataType> *s = new Node<DataType>;
         s->data_= a[i];
         r->next_ = s;
         r = s;
     }
     r->next_ = ;
 }

 template<typename DataType>
 inline LinkList<DataType>::~LinkList()
 {
     while (first_->next_ != )
     {
         Node<DataType> *p = new Node<DataType>;
         p = first_;
         first_ = first_->next_;
         delete p;
     }
 }

 template<typename DataType>
 inline int LinkList<DataType>::Length()
 {
     Node<DataType> *p = new Node<DataType>;
     p = first_->next_;
     int count = ;
     while (p != )
     {
         p = p->next_;
         ++count;
     }
     return count;
 }

 template<typename DataType>
 inline DataType LinkList<DataType>::Get_value(int serial_number)
 {
     Node<DataType> *p = new Node<DataType>;
     p = first_->next_;
     int count = ;
     while (p !=  && count < serial_number)
     {
         p = p->next_;
         ++count;
     }
     if (p == )
     {
         throw"non-existent";
     }
     else
     {
         return p->data_;
     }
 }

 template<typename DataType>
 inline int LinkList<DataType>::Locate_serial_number(DataType value)
 {
     Node<DataType> *p = new Node<DataType>;
     p = first_->next_;
     int count = ;
     while (p!=)
     {
         if (p->data_==value)
         {
             return count;
         }
         p = p->next_;
         ++count;
     }
     return ;

 }

 template<typename DataType>
 inline void LinkList<DataType>::insert(int i, DataType value)
 {
     Node<DataType> *p = new Node<DataType>;
     p = first_;
     int count = ;
     while (p !=  && count < i - )
     {
         p = p->next_;
         ++count;
     }
     if (p == )
     {
         throw"seat-non-existent";
     }
     else
     {
         Node<DataType> *s = new Node<DataType>;
         s->data_ = value;
         s->next_ = p->next_;
         p->next_ = s;
     }
 }

 template<typename DataType>
 inline DataType LinkList<DataType>::delete_value(int serial_number)
 {
     Node<DataType> *p = new Node<DataType>;
     p = first_;
     int count = ;
     while (p !=  && count < serial_number - )
     {
         p = p->next_;
         ++count;
     }
     if (p==||p->next_==)
     {
         throw"seat-non-existent";
     }
     else
     {
         Node<DataType>*q = p->next_;
         DataType x = q->data_;
         p->next_ = q->next_;
         delete q;
         return x;
     }
 }

 template<typename DataType>
 inline void LinkList<DataType>::PrintList()
 {
     Node<DataType>*p = new Node<DataType>;
     p = first_->next_;
     while (p!=)
     {
         cout << p->data_ << " ";
         p = p->next_;
     }
     cout << endl;
 }

---

测试类：

---

 //main.cpp

 #include"LinkList.h"
 #include"Node.h"

 int main() {
     int r[] = { ,,,, };
     LinkList<int>L(r, );

     cout << "第一次输出：";
     L.PrintList();

     cout << "第2个位置插入3后：";
     L.insert(, );
     L.PrintList();

     cout << "值为5的元素位置：";
     cout << L.Locate_serial_number() << endl;

     cout << "删除第一个元素后：";
     L.delete_value();
     L.PrintList();

     return ;
 }

---

运行结果：

---

---