单向链表

发表于

一种常见的基础数据结构，是一种线性表，但是并不会按线性的顺序存储数据，而是在每一个节点里存到下一个节点的指针(Pointer)。由于不必须按顺序存储，链表在插入的时候可以达到O(1)的复杂度，比另一种线性表顺序表快得多，但是查找一个节点或者访问特定编号的节点则需要O(n)的时间，而顺序表相应的时间复杂度分别是O(logn)和O(1)。
使用链表结构可以克服数组链表需要预先知道数据大小的缺点，链表结构可以充分利用计算机内存空间，实现灵活的内存动态管理。但是链表失去了数组随机读取的优点，同时链表由于增加了结点的指针域，空间开销比较大。

单向链表C++实现

C++ 实现代码如下

Node.h

1
2
3
4
5
6
7
8
9
10
11
12
#ifndef LINKED_LIST_NODE_H
#define LINKED_LIST_NODE_H
class Node
{
public:
    Node(int data=0);
    int Data;
    Node *p_Next;
};
#endif //LINKED_LIST_NODE_H

Node.cpp

1
2
3
4
5
6
#include "Node.h"
Node::Node(int data)
{
    Data=data;
}

List.h

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#ifndef LINKED_LIST_LIST_H
#define LINKED_LIST_LIST_H
#include "Node.h"
class List
{
public:
    List(void);				        //构造函数
    ~List(void);			        //析构函数
    void Clear_List();			        //清空该链表
    bool List_Empty();			        //判断链表是否为空
    int List_Length();			        //返回链表当前长度
    bool List_GetElem(int seat,Node *Elem);     //获取seat位置处元素的数据
    int List_Search(Node *Elem);       //查找第一个与Elem数据相同元素的位置，未找到返回-1
    bool List_Insert_Head(Node *Elem);		//在链表头插入一个结点
    bool List_Insert_Tail(Node *Elem);          //在链表尾插入一个节点
    bool List_Insert(int seat,Node *Elem);      //在seat位置插入一个节点
    bool List_Delete(Node *Elem);		//删除第一个与Elem数据相同的节点
    bool List_PriorElem(int seat,Node *Elem);	//获得seat处的前驱给Elem
    bool List_NextElem(int seat,Node *Elem);	//获得seat处的后继给Elem
    void List_Traverse();		        //遍历链表
private :
    int m_iLength;		                //链表当前长度
    Node *p_Head;		                //头结点
};
#endif //LINKED_LIST_LIST_H

List.cpp

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
#include "List.h"
#include <iostream>
using namespace std;
List::List(void)
{
    p_Head = new Node();
    if ( NULL == p_Head)
    {
        cout << "Memory failed!" << endl;
        exit(0);
    }
    p_Head->p_Next=NULL;
    m_iLength =0;
}
void List::Clear_List()
{
    Node *tempNode = p_Head->p_Next;
    Node *newNode = p_Head->p_Next;
    while ( NULL != tempNode)
    {
        newNode = tempNode->p_Next;
        delete tempNode;
        tempNode = newNode;
    }
    p_Head->p_Next=NULL;
    m_iLength=0;
}
List::~List(void)
{
    Clear_List();
    delete p_Head;
    p_Head=NULL;
}
bool List::List_Empty()
{
    if ( 0 == m_iLength )
    {
        return true;
    }
    else
        return false;
}
int List::List_Length()
{
    return m_iLength;
}
bool List::List_GetElem(int seat,Node *Elem)
{
    if (seat >= m_iLength || seat<0)
        return false;
    Node *tempNode = p_Head;
    for (int i=0;i<=seat;i++)
    {
        tempNode = tempNode->p_Next;
    }
    Elem->Data=tempNode->Data;
    return true;
}
int List::List_Search(Node *Elem)
{
    Node *tempNode = p_Head->p_Next;
    int count=0;
    while ( NULL != tempNode)
    {
        if ( Elem->Data==tempNode->Data)
        {
            return count;
        }
        tempNode = tempNode->p_Next;
        count++;
    }
    return -1;
}
bool List::List_Insert_Head(Node *Elem)
{
    //Node *tempNode =p_Head->p_Next;
    Node *NewNode = new Node();
    if ( NULL == NewNode)
        return false;
    NewNode->Data = Elem->Data;
    NewNode->p_Next = p_Head->p_Next;
    p_Head->p_Next = NewNode;
    m_iLength++;
    return true;
}
bool List::List_Insert_Tail(Node *Elem)
{
    Node *tempNode = p_Head;
    Node *NewNode = new Node();
    if ( NULL == NewNode)
        return false;
    NewNode->Data = Elem->Data;
    while ( NULL != tempNode->p_Next)
    {
        tempNode = tempNode->p_Next;
    }
    tempNode->p_Next = NewNode;
    NewNode->p_Next=NULL;
    m_iLength++;
    return true;
}
bool List::List_Insert(int seat,Node *Elem)
{
    if (seat>=m_iLength || 0>seat)
        return false;
    Node *NewNode = new Node();
    if ( NULL == NewNode )
        return false;
    NewNode->Data=Elem->Data;
    Node *tempNode = p_Head;
    for (int i=0;i<seat;i++)
    {
        tempNode=tempNode->p_Next;
    }
    NewNode->p_Next=tempNode->p_Next;
    tempNode->p_Next=NewNode;
    m_iLength++;
    return true;
}
bool List::List_Delete(Node *Elem)
{
    Node *tempNode = p_Head->p_Next;
    Node *priorNode = p_Head;
    while ( NULL != tempNode)
    {
        if (tempNode->Data == Elem->Data)
        {
            priorNode->p_Next=tempNode->p_Next;
            delete tempNode;
            tempNode=NULL;
            m_iLength--;
            return true;
        }
        priorNode=tempNode;
        tempNode=tempNode->p_Next;
    }
    return false;
}
bool List::List_PriorElem(int seat,Node *Elem)
{
    if ( 0 >= seat || seat>=m_iLength)
        return false;
    Node *tempNode = p_Head;
    for (int i=0;i<seat;i++)
    {
        tempNode=tempNode->p_Next;
    }
    Elem->Data=tempNode->Data;
    return true;
}
bool List::List_NextElem(int seat,Node *Elem)
{
    if ( 0 > seat || seat>=m_iLength-1)
        return false;
    Node *tempNode = p_Head->p_Next;
    for (int i=0;i<seat;i++)
    {
        tempNode=tempNode->p_Next;
    }
    Elem->Data=tempNode->p_Next->Data;
    return true;
}
void List::List_Traverse()
{
    Node *tempNode = p_Head->p_Next;
    while(NULL != tempNode)
    {
        cout << tempNode->Data << "-->" ;
        tempNode=tempNode->p_Next;
    }
}

main.cpp

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <iostream>
#include "List.h"
using namespace std;
int main() {
    auto *list=new List();
    Node n1(9);
    Node n2(1);
    Node n3(3);
    Node n4(5);
    cout << "Length:" << list->List_Length() <<endl;
    list->List_Insert_Head(&n1);
    list->List_Insert_Head(&n2);
    list->List_Insert(0,&n3);
    list->List_Insert_Tail(&n4);
    list->List_Traverse();
    cout <<endl;
    cout << "Length:" << list->List_Length() <<endl;
    list->List_GetElem(2,&n2);
    cout << "n2:"<<n2.Data <<endl;
    list->List_PriorElem(2,&n2);
    cout << "n2:"<<n2.Data <<endl;
    list->List_NextElem(2,&n2);
    cout << "n2:"<<n2.Data <<endl;
    cout << "n4 seat:" <<list->List_Search(&n4) <<endl;
    list->List_Delete(&n4);
    list->List_Traverse();
    cout << endl;
    delete list;
    return 0;
}

Output

1
2
3
4
5
6
7
8
Length:0
3-->1-->9-->5-->
Length:4
n2:9
n2:1
n2:5
n4 seat:3
3-->1-->9-->

源码文件

zip
-->