线性表的链式实现(C++)

相关内容：

线性表的顺序实现

链式实现（C语言）

 （推荐在GitHub上查看，下面代码只是最初实现，后续如果有修改，由于太麻烦，不会再更改下文，仅仅更新Github上的代码文件）

结点以及链表类的定义：





 1 #define ElemType int
 2 
 3 class LNode {
 4 public:
 5     LNode(ElemType ele, LNode *pointer) :data(ele), next(pointer) {
 6 
 7     }
 8 
 9     LNode(ElemType ele) {
10         data = ele;
11         next = nullptr;
12     }
13 
14     LNode() {
15         data = 0;
16         next = nullptr;
17     }
18 
19     ElemType data;
20     LNode *next;
21 };
22 
23 class LinkList {
24 public:
25     LinkList() {
26         head = nullptr;
27     }
28 
29     // 初始化时，创建一个长度为len的链表
30     LinkList(int len) {
31         head = nullptr;
32         this->LListAddNodes(len);
33     }
34 
35     ~LinkList() {
36         this->LListDestory();
37     }
38 
39     LNode *LListHead() {
40         return head;
41     }
42 
43     // 设置链表头结点
44     void LListSetHead(LNode *node) {
45         head = node;
46     }
47     
48     // 获取链表长度
49     int LListLength();
50 
51     // 判断链表是否为空
52     bool LListEmpty() {
53         return(head == nullptr) ? true : false;
54     }
55 
56     // 返回链表中第pos个结点
57     bool GetNode(int pos, LNode **node);
58 
59     // 返回指定data在链表中第一次出现的位置
60     bool LocateNode(ElemType ele, LNode **node);
61 
62     // 在指定位置插入后一个结点，但若pos为0是表示在链表头插入一个结点
63     bool LListInsert(int pos, LNode *node);
64 
65     // 删除指定位置结点
66     bool LListDelete(int pos);
67 
68     // 删除指定位置结点并返回被删除结点的信息
69     bool LListDelete(int pos, LNode *node);
70 
71     // 遍历线性表
72     void LListTraverse();
73 
74     // 在链表尾添加cnt个结点
75     bool LListAddNodes(int cnt);
76 
77     // 销毁链表，释放所有结点资源
78     void LListDestory();
79 
80 private:
81     LNode *head;
82 };






 


 




 具体实现：








  1 int LinkList::LListLength()
  2 {
  3     int cnt = 0;
  4     LNode *node = head;
  5 
  6     while (node != nullptr) {
  7         cnt++;
  8         node = node->next;
  9     }
 10     return cnt;
 11 }
 12 
 13 bool LinkList::GetNode(int pos, LNode **node)
 14 {
 15     if (pos > this->LListLength() || pos < 1)
 16         return false;
 17 
 18     LNode *cur = head;
 19 
 20     for (int i = 2; i <= pos; i++) {
 21         cur = cur->next;
 22     }
 23 
 24     *node = cur;
 25 
 26     return true;
 27 }
 28 
 29 bool LinkList::LocateNode(ElemType ele, LNode **node)
 30 {
 31     LNode *curNode = head;
 32     while (curNode != nullptr) {
 33          34
 35         if (curNode->data == ele) {
 36             *node = curNode;
 37             return true;
 38         }
            curNode = curNode->next;
 39     }
 40 
 41     return false;
 42 }
 43 
 44 bool LinkList::LListInsert(int pos, LNode *node)
 45 {
 46     // 插入位置错误
 47     if (pos < 0 || pos > this->LListLength())
 48         return false;
 49     
 50     if (pos == 0) {
 51         node->next = head;
 52         head = node;
 53     }
 54     else {
 55         LNode *temp = nullptr;
 56         this->GetNode(pos, &temp);
 57         node->next = temp->next;
 58         temp->next = node;
 59     }
 60 
 61     return true;
 62 }
 63 
 64 bool LinkList::LListDelete(int pos)
 65 {
 66     if (pos <1 || pos > this->LListLength())
 67         return false;
 68 
 69     if (pos == 1) {     // 删除头结点
 70         LNode *temp = head;
 71         head = temp->next;
 72         delete(temp);
 73     }
 74     else {
 75         LNode *temp_1 = nullptr; 
 76         LNode *temp_2 = nullptr;
 77         this->GetNode(pos - 1, &temp_1);  // 获取被删除结点的前一个结点
 78         temp_2 = temp_1->next;
 79         temp_1->next = temp_2->next;
 80         delete(temp_2);
 81     }
 82 
 83     return true;
 84 }
 85 
 86 // 删除结点立即释放结点所占用的空间，被返回的仅仅是被删除结点的信息
 87 bool LinkList::LListDelete(int pos, LNode *node)
 88 {
 89     if (pos <1 || pos > this->LListLength())
 90         return false;
 91 
 92     if (pos == 1) {     
 93         LNode *temp = head;
 94         head = temp->next;
 95         node->data = temp->data;
 96         node->next = temp->next;
 97         delete(temp);
 98     }
 99     else {
100         LNode *temp_1 = nullptr;
101         LNode *temp_2 = nullptr;
102         this->GetNode(pos - 1, &temp_1);
103         temp_2 = temp_1->next;
104         temp_1->next = temp_2->next;
105         node->data = temp_2->data;
106         node->next = temp_2->next;
107         delete(temp_2);
108     }
109 
110     return true;
111 }
112 
113 void LinkList::LListTraverse()
114 {
115     LNode *curNode = head;
116 
117     while (curNode != nullptr) {
118         std::cout << curNode->data << std::endl;
119         curNode = curNode->next;        
120     }
121 }
122 
123 bool LinkList::LListAddNodes(int cnt)
124 {
125     //std::cout << cnt << std::endl;
126 
127     if (cnt < 0)
128         return false;
129     else if (cnt == 0)
130         return true;
131 
132     LNode *curNode = head;
133 
134     if (curNode != nullptr) {
135         // 找到链表尾结点
136         while (curNode->next != nullptr) {
137             curNode = curNode->next;
138         }
139 
140         for (int i = 0; i < cnt; i++) {
141             int temp;
142             std::cin >> temp;
143             LNode *node = new LNode(temp);
144 
145             if (!node) {
146                 return false;
147             }
148 
149             //node->next = nullptr;
150             //node->data = i;
151 
152             curNode->next = node;
153             curNode = node;
154         }
155     }
156     else {
157         int temp;
158         std::cin >> temp;
159         LNode *node = new LNode(temp);
160         head = node;
161         curNode = node;
162 
163         for (int i = 0; i < cnt - 1; i++) {
164             std::cin >> temp;
165             node = new LNode(temp);
166 
167             if (!node) {
168                 //std::cout << "new Error!" << std::endl;
169                 return false;
170             }
171 
172             curNode->next = node;
173             curNode = node;
174         }
175     }
176 
177     return true;
178 }
179 
180 void LinkList::LListDestory()
181 {
182     //std::cout << "Destory!" << endl;
183     LNode *cur = head;
184 
185     if (!cur)
186         return;
187 
188     LNode *next = cur->next;
189 
190     while (cur) {
191         delete cur;
192         
193         if (next) {
194             cur = next;
195             next = next->next;
196         }
197         else
198             break;
199     }
200 }






 


 




用于测试的代码及测试结果：




#include "link_list.h"

int main()
{
    //LNode node(5);
    //if (node.next == nullptr)
        //std::cout << "next = nullptr, data = " << node.data << std::endl;

    LinkList list(5);
    //LinkList list;

    int len = list.LListLength();
    std::cout << "InitLen = " << len << std::endl;

    if (list.LListEmpty())
        std::cout << "Empty List!" << std::endl;

    std::cout << std::endl << "First Traverse: " << std::endl;

    list.LListTraverse();

    std::cout << std::endl << "Insert two Node!" << std::endl;

    LNode *node = new LNode(0);

    if (!node)
        std::cout << "new Error!" << std::endl;

    LNode *node_2 = new LNode(6);

    if (!node_2)
        std::cout << "new Error!" << std::endl;

    list.LListInsert(0, node);
    list.LListInsert(6, node_2);

    len = list.LListLength();
    std::cout << "CurLen = " << len << std::endl;

    std::cout << std::endl << "Second Traverse: " << std::endl;
    list.LListTraverse();

    std::cout << "Get Node's Data!" << std::endl;
    LNode *node_pos_3 = nullptr;
    list.GetNode(3, &node_pos_3);

    std::cout << "node_pos_3: " << "data = " << node_pos_3->data << std::endl;
    
    LNode node_del;
    if (list.LListDelete(3, &node_del)) {
        std::cout << "Delete Node: " << "data = " << node_del.data << std::endl;
    }

    len = list.LListLength();
    std::cout << "CurLen = " << len << std::endl;

    std::cout << std::endl << "Third Traverse: " << std::endl;
    list.LListTraverse();

    std::cout << "End..." << std::endl;
    int temp;
    std::cin >> temp;

    return 0;
}

/*
输出信息：
1
2
3
4
5
InitLen = 5

First Traverse:
1
2
3
4
5

Insert two Node!
CurLen = 7

Second Traverse:
0
1
2
3
4
5
6
Get Node's Data!
node_pos_3: data = 2
Delete Node: data = 2
CurLen = 6

Third Traverse:
0
1
3
4
5
6
End...
*/




 







            

            
posted @ 
2019-05-09 22:34 
荒唐了年少 
阅读(683) 
评论(0) 
编辑 
收藏 
举报