#include<iostream>
#include<cstdlib>
using namespace std;
struct Node{
int a;
struct Node *pNext;
};
//链表头尾指针
struct Node *g_pHead = NULL;
struct Node *g_pEnd = NULL;
//创建链表,在链表中增加一个数据 尾添加
void AddListEnd(int a) {
//创建节点
struct Node* pTemp = (struct Node*) malloc(sizeof(struct Node));
//节点数据进行赋值·
pTemp->a = a;
pTemp->pNext = NULL;
//链接
if (NULL == g_pHead || NULL == g_pEnd) {
//空链表 既是头也是尾
g_pHead = pTemp;
g_pEnd = pTemp;
}
else {
g_pEnd->pNext = pTemp;
g_pEnd = pTemp;
}
}
//创建链表,在链表中增加一个数据 头添加
void AddListHead(int a) {
struct Node* pTemp = (struct Node*) malloc(sizeof(struct Node));
pTemp->a = a;
pTemp->pNext = NULL;
if (NULL == g_pHead || NULL == g_pEnd) {
g_pHead = pTemp;
g_pEnd = pTemp;
}
else {
pTemp->pNext = g_pHead;
g_pHead = pTemp;
}
}
int main() {
g_pHead;
for (int i = 0; i < 10; i++) {
AddEndList(i);
}
for (int i = 0 i < 10; i++) {
AddHeadList(i);
}
system("pause");
return 0;
}
单链表的头添加尾添加
最新推荐文章于 2022-08-22 04:30:00 发布