C++ 实现单链表创建、插入和删除

#include <iOStream>
#include <stdio.h>
#include <string>
#include <coNIO.h>
 

 

 
using namespace std;
 
struct node
{
	int data;
	node *next;
};
typedef struct node node, *list;
 
// 创建单链表
node *creat()
{
	node *head, *p;
	head = new node;
	p = head;
 
	int x, cycle = 1;
	while (cycle)
	{
		cout << "Please input the data for single linker : ";
		cin >> x;
 
		if (x != 0)
		{
			node *s = new node;
			s->data = x;
			cout << "Input data : " << x << endl;
 
			p->next = s;
			p = s;
		}
		else
		{
			cycle = 0;
			cout << "Input done! " << endl;
		}
	}
 
	head = head->next;
	p->next = NULL;
	//cout << "\nFirst data of single linker is " << head->data << endl;
 
	return head;
}
 
// 单链表测长
int length(node *head)
{
	int n = 0;
	node *p = head;
 
	while (p != NULL)
	{
		p = p->next;
		n++;
	}
 
	return n;
}
 
// 单链表打印
void printL(node *head)
{
	node *p = head;
 
	while (p != NULL)
	{
		cout << "Single Linker data is " << p->data << endl;
		p = p->next;
	}
}
 
// 单链表插入
node *insert(node *head, int num)
{
	node *p0, *p1, *p2;
	p1 = head;
 
	p2 = new node;
	p0 = new node; // 插入节点
	p0->data = num;// 插入数据
 
	while (p0->data > p1->data && p1->next != NULL)
	{
		p2 = p1;
		p1 = p1->next;// p0,p1和p2位置: p2->p1->p0
	}
 
	if (p0->data <= p1->data)
	{
		if (p1 == head)
		{// 头部前段插入 p0和p1位置: p0->p1->...
			head = p0;
			p0->next = p1;
		}
		else
		{// 插入中间节点 p0,p1和p2位置: p2-> p0 -> p1
			p2->next = p0;
			p0->next = p1;
		}
	}
	else
	{   // 尾部插入节点 p0,p1和p2位置: p2->p1->p0->NULL
		p1->next = p0;
		p0->next = NULL;
	}
	return head;
}
 
// 单链表删除
node *del(node *head, int num)
{
	node *p1, *p2;
	p2 = new node;
	p1 = head;
 
	while (num != p1->data && p1->next != NULL)
	{
		p2 = p1;
		p1 = p1->next;// p1和p2位置: p2->p1		
	}
 
	if (num == p1->data)
	{
		if (p1 == head)// 删除头节点
		{
			head = p1->next;
			delete p1;
		}
		else
		{
			p2->next = p1->next;
			delete p1;
		}
	}
	else
	{
		cout << num << " could not been found in the current single linker!" << endl;
	}
	return head;
}
 
//=============插入排序====================
node *insertSort( node *head )
{
	node  *p1, *prep1, *p2, *prep2, *temp;
	prep1 = head->next;
	p1 = prep1->next;
	//prep1和p1是否需要手动后移
	bool flag;
 
	while (p1 != NULL)
	{
		flag = true;
		temp = p1;
		//由于是单向链表，所以只能从头部开始检索
		for (prep2 = head, p2 = head->next; p2 != p1; prep2 = prep2->next, p2 = p2->next)
		{
			//发现第一个较大值
			if (p2->data > p1->data)
			{
				p1 = p1->next;
				prep1->next = p1;
				prep2->next = temp;
				temp->next = p2;
				flag = false;
				break;
			}
		}
		//手动后移prep1和p1
		if (flag)
		{
			prep1 = prep1->next;
			p1 = p1->next;
		}
	}
	return head;
}
 
int main()
{
	cout << "***创建单链表***" << endl;
	node *head = creat();
	cout << endl;
 
	cout << "***计算链表长***" << endl;
	int n = length(head);
	cout << "The length of input single linker is " << n << "." << endl;
	cout << endl;
 
	cout << "***打印单链表***" << endl;
	printL(head);
	cout << endl;
 
	cout << "****插入节点****" << endl;
	cout << "Please input the data for inserting operate : ";
	int inData;
	cin >> inData;
	head = insert(head, inData);
	printL(head);
	cout << endl;
 
	cout << "****删除节点****" << endl;
	cout << "Please input the data for deleting operate : ";
	int outData;
	cin >> outData;
	head = del(head, outData);
	printL(head);
	cout << endl;
 
	cout << "****进行排序****" << endl;
	//第一位地址可以存放指示器，从第二位开始保存数据
	node *mylist = new node[sizeof(node)];
	mylist->data = 0;
	mylist->next = NULL;
 
	int len = length(head);
	int i = 0;
	node * cur = mylist;
 
 
	node *headcopy = head;
	while (len--)
	{
		//node * newNode = (node *)malloc(sizeof(node));   
		node *newNode = new node[sizeof(node)];            
		newNode->data = headcopy->data;
		newNode->next = NULL;
		cur->next = newNode;
		cur = cur->next;
		headcopy=headcopy->next;
	}
	head = insertSort(mylist);
	head = del(head, 0);
	printL(head);
 
	return 0;
}

#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
// 单链表结点
struct LNode {
    int data;    // 数据域
    LNode *next; // 指针域
};
typedef LNode LNode;     // LNode表示单链表的一个结点
typedef LNode *LinkList; // LinkList表示一个单链表
// 初始化单链表
void InitList(LinkList &L) {
    L = new LNode;
    // L = (LNode *)malloc(sizeof(LNode));
    L->next = NULL;
}
// 判断单链表是否为空
bool Empty(LinkList &L) {
    if (L->next == NULL) {
        return true;
    } else {
        return false;
    }
}
// 获取单链表长度
int GetLength(LinkList &L) {
    LNode *p = L->next;
    int length = 0;
    while (p != NULL) {
        p = p->next;
        length++;
    }
    return length;
}
// 按位查找：查找第i个结点
LNode *GetElem(LinkList &L, int i) {
    if (i < 0) {
        return NULL; // i值不合法
    }
    LNode *p = L;
    int j = 0;
    while (p != NULL && j < i) {
        p = p->next;
        j++;
    }
    return p;
}
// 按值查找：查找数据域为e的结点
LNode *GetLNode(LinkList &L, int e) {
    LNode *p = L->next;
    while (p != NULL && p->data != e) {
        p = p->next;
    }
    return p;
}
// 头插法建立单链表
LinkList List_HeadInsert(LinkList &L) {
    int e;
    cin >> e;
    while (e != 9999) {
        LNode *s = new LNode;
        s->data = e;
        s->next = L->next;
        L->next = s;
        cin >> e;
    }
    return L;
}
// 尾插法建立单链表
LinkList List_TailInsert(LinkList &L) {
    LNode *r = L; // r为尾指针
    int e;
    cin >> e;
    while (e != 9999) {
        LNode *s = new LNode;
        s->next = r->next;
        s->data = e;
        r->next = s;
        r = s; // 将r置为新的尾指针
        cin >> e;
    }
    r->next = NULL; // 尾指针的next置为NULL
    return L;
}
// 前插操作：在p结点之前插入数据e
bool InsertPriorNode(LNode *p, int e) {
    if (p == NULL) {
        return false;
    }
    LNode *s = new LNode;
    s->next = p->next;
    s->data = p->data; // 数据后移，模拟结点后移
    p->next = s;
    p->data = e; // 将前结点置为新插入的结点
    return true;
}
// 后插操作：在p结点之后插入数据e
bool InsertNextNode(LNode *p, int e) {
    if (p == NULL) {
        return false;
    }
    LNode *q = new LNode;
    q->data = e;
    q->next = p->next;
    p->next = q;
    return true;
}
// 按位序插入
bool InserstList(LinkList &L, int i, int e) {
    if (i < 1) { // i值不合法
        return false;
    }
    LNode *p = GetElem(L, i - 1); // 遍历查找i-1个结点
    InsertNextNode(p, 5244);      // 使用后插法
    
    return true;
}
// 删除p结点的后继结点
bool DeleteNextDNode(LNode *p) {
    if (p == NULL || p->next == NULL) {
        return false;
    }
    LNode *s = new LNode;
    s = p->next;
    p->next = s->next;
    delete s;
    return true;
}
// 删除指定结点
bool DeleteNode(LNode *p) {
    if (p == NULL) {
        return false;
    }
    LNode *s = new LNode;
    s = p->next;       // q指向被删除结点
    p->data = s->data; // 数据前移，模拟结点前移
    p->next = s->next; // 断开与被删除结点的联系
    delete s;
    return true;
}
// 按位序删除
bool ListDelte(LinkList &L, int i, int &e) {
    if (i < 1) {
        return false;
    }
    
    LNode *p = GetElem(L, i - 1);
    e = p->next->data;
    DeleteNextDNode(p);  // 删除前一结点的后继结点
    return true;
}
// 遍历单链表
void TraverseList(LinkList &L) {
    if (L->next == NULL) {
        return;
    }
    LNode *p = L->next; // 指向头指针
    while (p != NULL) {
        cout << p->data << " ";
        p = p->next;
    }
    cout << endl;
}
int main() {
    LinkList L;
    InitList(L);
    L = List_TailInsert(L); // 尾插法
    // L = List_HeadInsert(L);  // 头插法
    TraverseList(L);
    InserstList(L, 1, 5244);
    TraverseList(L);
    int e = -1;
    ListDelte(L, 3, e);
    cout << "被删除的值：" << e << endl;
    TraverseList(L);
    cout << "长度：" << GetLength(L) << endl;
    return 0;
}