C++链表的增、删、改、查、冒泡排序、清空、销毁基本操作

主函数文件

main.cpp

#include <iostream>
#include "shengming.h"
using namespace std;

int main(){
   
	List s;
	s.createList();
	s.headInsertNode(100);
	s.endInsertNode(1000);
	s.insertNode(40,4);
	s.modNode(5,50);
	s.pointList();
	s.listLength();
	s.findNodeAdd(50);
	s.listSort();
	s.delHeadNode();
	s.delEndNode();
	s.delAllNode();
	return 0;
}

成员函数定义文件

dingyi.cpp

#include <iostream>
#include "shengming.h"

using namespace std;
int List::size = 10;

List::List()                   //构造函数，并初始化头结点
{
   
	cout<<"构造函数的调用..."<<endl;
	head = new Node;
	head->num = 0;
	head->next = NULL;
}
List::~List()                  //析构函数
{
   
	cout<<"析构函数的调用..."<<endl;
	clearList();
	delete head;
	head = NULL;
}
void List::createList()        //创建链表
{
   
	Node* p = head;
	for(int i=0; i<size; i++){
   
		Node* pnew = new Node;
		pnew->num = i+1;
		pnew->next = NULL;
		p->next = pnew;
		p = pnew;
	}
	pointList();
}
void List::pointList()         //打印输出链表
{
   
	Node* p = head;
	while(p->next)