C++实现链表

linklist.h

#pragma once

#include <stddef.h>

using namespace std;

typedef struct Node {
	int n;
	int value_x;
	int value_y;
	Node *next;
	Node(int n, int value_x, int value_y) :n(n), value_x(value_x), value_y(value_y),next(NULL) {};
	Node() {};
} SNode;
class LinkList {
public:
	void create();           //初始化
	void insertHead(SNode* p);  //头插法
	void insertTail(SNode* p);  //尾插法
	SNode* findByIndex(int);  //根据索引查找节点，并返回节点的指针，注意0返回头节点
	SNode* findByValue(int);  //根据值查找节点，并返回节点的指针，注意0返回头节点
	int  getLength();        //获取链表的长度
	void deleteByIndex(int); //根据索引删除节点
	void deleteByValueOnce(int); //根据节点值删除第一个节点
	void deleteByValueAll(int);//根据节点值删除所有节点
	void editByIndex(int, int);   //根据索引修改节点的值
	void print();
	void clear();
//private:
	SNode* head;        //头节点指针,value用于存放链表的长度
};

linklist.cpp

#include "stdafx.h"
#include "LinkList.h"

void LinkList::create()
{
	head = new Node();
	head->next = NULL;
	head->n = 0;
}

void LinkList::insertHead(Node *p)
{
	p->next = head->next;
	head->next = p;
	head->n++;
}

void LinkList::insertTail(Node *p)
{
	Node *tail = findByIndex(head->n);
	if (tail == NULL)
		insertHead(p);
	else {
		p->next = tail->next;
		tail->next = p;
	}
	head->n++;
}

Node * LinkList::findByIndex(int index)
{
	Node* p = head;
	int i = 0;
	if (index<0 || index >getLength()) {
		return NULL;
	}
	while (p) {
		if (i == index)
			return p;
		else {
			p = p->next;
			i++;
		}
	}
	return NULL;
}

Node * LinkList::findByValue(int num)
{
	Node* p = head->next;
	for (; p; p = p->next) {
		if (p->value_x == num)
			return p;
	}
	return NULL;
}

int LinkList::getLength()
{
	return head->n;
}

void LinkList::deleteByIndex(int index)
{
	if (index == 0) {
		return;
	}
	Node* p = findByIndex(index);
	if (!p) {
		return;
	}
	else {
		Node* q = findByIndex(index - 1);
		q->next = p->next;
		head->n--;
		delete p;
	}
}

void LinkList::deleteByValueAll(int n)
{
	Node* p = head->next;
	Node* q = head;
	bool flag = false;
	while (p) {
		if (p->n == n) {
			q->next = p->next;
			Node* temp = p;
			p = p->next;		//
			delete temp;
			head->n--;
			if (p->n != n)
				flag = true;
		}
		else {
			p = p->next;
			q = q->next;
		}
	}
	if (!flag) {
		return;
	}
}

void LinkList::print()
{
	for (Node* p = head->next; p; p = p->next) {
		//cout << p->value << " ";
	}
	//cout << endl;
}

void LinkList::clear()
{
	while (head->next)
	{
		deleteByIndex(getLength());
	}
}