链表 C/C++ 底层实现
前言
尽管在STL中已经有了比较完美的链表库如 forward_list 和 list 等，在初学数据结构的过程中也是应当用最基本的C/C++语言来完成链表的编写，这样才对链表有更清晰的认识。
C++ 版本
一.单链表
#include <iostream>
#include <ctime>
#include <unistd.h>
using namespace std;
//单链表 有些类似stl中的forward_list
struct Node
{
int data;
struct Node *next;
Node(int data) : data(data), next(NULL) {}
};
/***********************************类申明**********************************/
class List
{
Node *_head; //头指针
Node *_tail; //尾指针
public:
List();
~List();
void headInsertCreate();//头插法创建
void tailInsertCreate();//尾插法创建
void traverse();
size_t size() const;
private:
void headInsert(Node *node);
void tailInsert(Node *node);
void destory();
};
/******************************类成员定义*********************************/
List::List()
: _head(new Node(0)), _tail(_head)
{
cout << "List()" << endl;
}
List::~List()
{
if (_head)
{
destory();
delete _head;
_head = NULL;
cout << "~List()" << endl;
}
}
size_t List::size() const
{
size_t cnt = 0;
Node* p = _head->next;
while (p){ cnt++; p = p->next;}
return cnt;
}
void List::destory()
{
Node *p = _head->next;
while (p)
{
Node *temp = p;
p = p->next;
delete temp;
temp = NULL;
}
}
void List::traverse()
{
Node *p = _head->next;
while (p)
{
cout << p->data << " ";
p = p->next;
}
cout << endl;
}
void List::headInsertCreate()
{
cout << "input the size of list:" << endl;
size_t len;
cin >> len;
for (size_t i = 0; i < len; i++)
{
Node *node = new Node(rand() % 100);
if (!_head->next)
_tail = node;
headInsert(node);
}
}
void List::tailInsertCreate()
{
cout << "input the size of list:" << endl;
size_t len;
cin >> len;
for (size_t i = 0; i < len; i++)
{
Node *node = new Node(rand()%100);
tailInsert(node);
}
}
void List::headInsert(Node *node)
{
node->next = _head->next;
_head->next = node;
}
void List::tailInsert(Node *node)
{
_tail->next = node;
_tail = node;
}
int main()
{
List list;
list.tailInsertCreate();
list.traverse();
cout << "size():" << list.size() << endl;
return 0;
}
二.双链表
#include <iostream>
#include <ctime>
#include <unistd.h>
using namespace std;
//双链表 类比stl中的list
struct Node
{
int data;
struct Node *prev;
struct Node *next;
Node(int data) : data(data), prev(NULL), next(NULL) {}
};
/***********************************类申明**********************************/
class List
{
Node *_head; //头指针
Node *_tail; //尾指针
public:
List();
~List();
void headInsertCreate(); //头插法创建
void tailInsertCreate(); //尾插法创建
void forward_traverse(); //正向遍历
void reverse_traverse(); //逆向遍历
size_t size() const;
private:
void headInsert(Node *node);
void tailInsert(Node *node);
void destory();
};
/******************************类成员定义*********************************/
List::List()
: _head(new Node(0)), _tail(_head)
{
cout << "List()" << endl;
}
List::~List()
{
if (_head)
{
destory();
delete _head;
_head = NULL;
cout << "~List()" << endl;
}
}
size_t List::size() const
{
size_t cnt = 0;
Node *p = _head->next;
while (p)
{
cnt++;
p = p->next;
}
return cnt;
}
void List::destory()
{
Node *p = _head->next;
while (p)
{
Node *temp = p;
p = p->next;
delete temp;
temp = NULL;
}
}
void List::forward_traverse()
{
Node *p = _head->next;
while (p)
{
cout << p->data << " ";
p = p->next;
}
cout << endl;
}
void List::reverse_traverse()
{
Node *p = _tail;
while (p != _head)
{
cout << p->data << " ";
p = p->prev;
}
cout << endl;
}
void List::headInsertCreate()
{
cout << "input the size of list:" << endl;
size_t len;
cin >> len;
for (size_t i = 0; i < len; i++)
{
Node *node = new Node(rand() % 100);
if (!_head->next)
_tail = node;
headInsert(node);
}
}
void List::tailInsertCreate()
{
cout << "input the size of list:" << endl;
size_t len;
cin >> len;
for (size_t i = 0; i < len; i++)
{
Node *node = new Node(rand() % 100);
tailInsert(node);
}
}
void List::headInsert(Node *node)
{
if (_head->next)
{
node->next = _head->next;
_head->next->prev = node;
}
node->prev = _head;
_head->next = node;
}
void List::tailInsert(Node *node)
{
_tail->next = node;
node->prev = _tail;
_tail = node;
}
int main()
{
List list;
list.headInsertCreate();
list.forward_traverse();
list.reverse_traverse();
cout << "size():" << list.size() << endl;
return 0;
}
C版本实现
一.单链表
#include <stdio.h>
#include <stdlib.h>
typedef char ElemType;
typedef struct Node
{
ElemType data;
struct Node *next;
}Node, *LinkList;
//链表初始化
void ListInit(LinkList *head);
//头插法
void HeadInsert(LinkList *head, ElemType e);
//尾插法
void TailInsert(LinkList *tail, ElemType e);
//头插法创建
void HeadInsertCreate(LinkList* head);
//尾插法创建
void TailInsertCreate(LinkList* tail);
//遍历链表
void Traverse(LinkList head);
//求链表长
int Length(LinkList head);
//通过序号返回节点，i表示第i个
LinkList GetByindex(LinkList head, int i);
//通过值返回节点
LinkList GetByValue(LinkList head, ElemType e);
//删除节点操作,第i个节点
int Delete(LinkList *head, int i);
//链表初始化
void ListInit(LinkList *head) {
(*head) = (LinkList)malloc(sizeof(Node));
(*head)->next = NULL;
(*head)->data = -1;
}
/*
注意头插法与尾插法这两个地方的 LinkList(*head) 不能用 LinkList Head = *head 来替代，和函数中变量a,b指向同一个地址的例子的原理相同，Head是
属于没有指向head地址的变量，并不能真正改变*head的值
*/
//头插法
void HeadInsert(LinkList *head, ElemType e) {
LinkList pNew = (LinkList)malloc(sizeof(Node));
pNew->next = NULL;
pNew->data = e;
pNew->next = (*head)->next;
(*head)->next = pNew;
}
//尾插法
void TailInsert(LinkList *tail, ElemType e) {
LinkList pNew = (LinkList)malloc(sizeof(Node));
pNew->next = NULL;
pNew->data = e;
pNew->next = (*tail)->next;
(*tail)->next = pNew;
(*tail) = pNew;
}
//头插法创建
void HeadInsertCreate(LinkList* head) {
printf("头插法创建链表，请输入字符:(输入'#'时终止)\n");
char ch;
while ((ch = getchar()) != '#') {
HeadInsert(head, ch);
}
}
//尾插法创建
void TailInsertCreate(LinkList* tail) {
printf("尾插法创建链表，请输入字符:(输入'#'时终止)\n");
char ch;
while ((ch = getchar()) != '#') {
TailInsert(tail, ch);
}
}
//遍历链表
void Traverse(LinkList head) {
LinkList p = head->next;
while (p) {
printf("%c->", p->data);
p = p->next;
}
printf("NULL\n");
}
//求链表长
int Length(LinkList head) {
LinkList p = head->next;
int cnt = 0;
while (p) cnt++, p = p->next;
return cnt;
}
//通过序号返回节点，i表示第i个
LinkList GetByindex(LinkList head, int i) {
if (i < 1 || i > Length(head))//i越界
return NULL;
int cnt = 1;
LinkList p = head->next;
while (cnt != i) p = p->next, cnt++;
return p;
}
//通过值返回节点
LinkList GetByValue(LinkList head, ElemType e) {
LinkList p = head->next;
while (p) {
if (p->data == e)
return p;
p = p->next;
}
return NULL;
}
/*
注意在删除节点的操作的过程中，发生了出错的点：
1.写到了LinkList *p = (*head)->next;这条语句,然后在接下来的操作中不断地使用诸如(*p)->等语句
这样写是不对的,我们将*head传入的原因是因为我们需要改变链表的内部值而非指向，接下来直接使用
LinkList p = (*head)->next；再使用p->等语句直接操作就可以了，因为在最开始已经将*head传入了
2.因为要将p指向到i-1个节点，所以应该考虑删除第一个节点的情况，删除最后一个节点的情况倒是无所谓,这时候又体现了头结点的作用
*/
//删除节点操作,第i个节点
int Delete(LinkList *head, int i) {
if (i < 1 || i > Length(*head))
return 0;
int cnt = 0;
LinkList p = *head;
while (cnt != i - 1) p = p->next,cnt++;//p指向第i-1个节点
//删除操作
LinkList temp = p->next;//temp指向第i个节点
p->next = p->next->next;
free(temp);
return 1;
}
int main()
{
LinkList head = NULL; //定义头结点,并且规定，头结点不存放数据
ListInit(&head);
LinkList tail = head;//定义尾节点，指向头结点
TailInsert(&tail, 'a');
TailInsert(&tail, 'b');
TailInsert(&tail, 'c');
TailInsert(&tail, 'd');
Traverse(head);
return 0;
}
二.双链表
#include <stdio.h>
#include <stdlib.h>
typedef char ElemType;
typedef struct Node
{
ElemType data;
struct Node *prior;
struct Node *next;
}Node, *LinkList;
//链表初始化
void ListInit(LinkList *head);
//头插法
void HeadInsert(LinkList *head, ElemType e);
//尾插法
void TailInsert(LinkList *head, ElemType e);
//从头遍历链表
void HeadTraverse(LinkList head);
//从尾到头遍历链表
void TailTraverse(LinkList tail, LinkList head);
//求链表长
int Length(LinkList head);
//删除节点操作,第i个节点
int Delete(LinkList *head, int i);
//链表初始化
void ListInit(LinkList *head) {
(*head) = (LinkList)malloc(sizeof(Node));
(*head)->data = -1;
(*head)->next = NULL;
(*head)->prior = NULL;
}
//插入,使用头插法
void HeadInsert(LinkList *head, ElemType e) {
LinkList pNew = (LinkList)malloc(sizeof(Node));
pNew->data = e;
pNew->next = NULL;
pNew->prior = NULL;
if ((*head)->next == NULL) {//如果链表为空（即只有一个头结点）
pNew->prior = (*head);
(*head)->next = pNew;
}
else {
//有四处需要改
pNew->next = (*head)->next;
(*head)->next->prior = pNew;
pNew->prior = (*head);
(*head)->next = pNew;
}
}
//尾插法
void TailInsert(LinkList *tail, ElemType e) {
LinkList pNew = (LinkList)malloc(sizeof(Node));
pNew->data = e;
pNew->next = NULL;
pNew->prior = NULL;
(*tail)->next = pNew;
pNew->prior = (*tail);
(*tail) = pNew;
}
//从头遍历链表
void HeadTraverse(LinkList head) {
LinkList p = head->next;
while (p) {
printf("%c->", p->data);
p = p->next;
}
printf("NULL\n");
}
//从尾到头遍历链表
void TailTraverse(LinkList tail, LinkList head) {
LinkList p = tail;
while (p != head) {
printf("%c->", p->data);
p = p->prior;
}
printf("Head\n");
}
//求链表长
int Length(LinkList head) {
LinkList p = head->next;
int cnt = 0;
while (p) cnt++, p = p->next;
return cnt;
}
//删除节点操作,第i个节点
int Delete(LinkList *head, int i) {
if (i < 1 || i > Length(*head))
return 0;
int cnt = 0;
LinkList p = *head;
while (cnt != i - 1) p = p->next, cnt++;//p指向第i-1个节点
//删除操作
LinkList temp = p->next;//temp指向第i个节点
if (i == Length(*head)) {//如果删除的是最后一个元素
p->next = NULL;
}
else {
temp->next->prior = p;
p->next = temp->next;
}
free(temp);
return 1;
}
int main()
{
LinkList head = NULL;
ListInit(&head);
LinkList tail = head;
TailInsert(&tail, '1');
TailInsert(&tail, '2');
TailInsert(&tail, '3');
TailInsert(&tail, '4');
HeadTraverse(head);
Delete(&head, 3);
HeadTraverse(head);
return 0;
}
扫一扫
9万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
