数据结构之线性表（C++实现）

顺序表

函数声明 List.h（顺序表的定义，各项功能和变量）

#pragma once
#define Elem int

class List
{
public:
	List(int size);//创建线性表
	~List();//销毁线性表
	void ClearList();//清空线性宝
	bool ListEmpty();//判断线性表是否为空
	int ListLengh();//获取线性表的长度
	bool GetElem(int i, Elem* e);//获取位置i的元素(i就是下标)
	int LocateElem(Elem* e);//获取元素值等于e的元素的位置

	bool PreElem(Elem* currentElem, Elem* preElem);//获取指定元素的前驱	
	bool NextElem(int* currentElem, int* nextElem);//获取指定元素的后继
	void ListTravel();//遍历
	bool ListInsert(int i, int* e);//在位置i插入元素e
	bool ListDelete(int i, int* e);//删除位置i的元素，并将值记录到e
private:
	int* m_plist;
	int m_iSize;
	int m_iLength;
};

函数实现

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

List::List(int size)
{
	m_iSize = size;
	m_plist = new int[m_iSize];
	m_iLength = 0;
}
List::~List()
{
	delete[]m_plist;
	m_plist = NULL;
}
void List::ClearList()
{
	m_iLength = 0;
}
bool List::ListEmpty()
{
	if (m_iLength == 0)
		return true;
	else
		return false;
}
int List::ListLengh()
{
	return m_iLength;
}
bool List::GetElem(int i, Elem* e)
{
	if (i<0 || i>=m_iSize)
	{
		return false;
	}
	else
		*e = m_plist[i];
	return true;
}
int List::LocateElem(Elem* e)
{
	for (int i = 0; i < m_iLength; i++)
	{
		if (m_plist[i] == *e)
		{
			return i;
		}
	}
	return -1;
}
bool List::PreElem(Elem* currentElem, Elem* preElem)
{
	int temp = LocateElem(currentElem);
	if (temp == -1)//没有指定元素时LocateElem（）返回-1
	{
		return false;
	}
	else
	{
		if (temp == 0)	return false;//第一个元素（0号位置）没有前驱
		else {
			*preElem = m_plist[temp - 1];
		}
	}
}
bool List::NextElem(int* currentElem, int* nextElem)
{
	int temp = LocateElem(currentElem);
	if (temp == -1)
	{
		return false;
	}
	else
	{
		if (temp == m_iLength - 1)	return false;//最后一个元素(位置为m_iLength-1）没有后继
		else {
			*nextElem = m_plist[temp + 1];
		}
	}

}
void List::ListTravel()
{
	for (int i = 0; i < m_iLength; i++)
	{
		cout << m_plist[i];
	}
}
bool List::ListInsert(int i, int* e)
{
	if (i<0 || i>m_iLength)	return false;//i=m_iLength,插入末尾。i=0插在头部

	for (int k = m_iLength - 1; k >= i; k--)
	{
		//从最后一个元素开始往后挪，把i号位置空出来
		m_plist[k + 1] = m_plist[k];
	}
	m_plist[i] = *e;
	m_iLength++;
	return true;
}
bool List::ListDelete(int i, int* e)
{
	if (i < 0 || i >= m_iLength)	return false;
	*e = m_plist[i];
	for (int k = i; k < m_iLength - 1; k++)
	{
		m_plist[k] = m_plist[k + 1];
	}
}

链表

定义结点Node

#pragma once


class Node
{
public:
	int date;
	Node* next;
	void printNode(){
	cout<<this->date<<endl;
	}
};

函数声明

#ifndef LIST_H
#define LIST_H

#include"Node.h"
class List
{
public:
	List();//创建线性表
	~List();//销毁线性表
	void ClearList();//清空线性表
	bool ListEmpty();//判断线性表是否为空，空返回true
	int ListLength();//获取线性表的长度
	bool GetElem(int i, Node* pNode);//获取指定位置i的元素
	int LocateElem(Node* pNode);//获取某个元素的位置
	bool PreElem(Node* pCurrentNode, Node* pPreNode);//获取某个元素的前驱
	bool NextElem(Node* pCurrentNode, Node* pNextNode);//获取某个元素的后继
	void ListTraval();//遍历链表
	bool ListInsert(int i, Node* pNode);//插入结点
	bool ListDelete(int i, Node* pNode);//删除结点
	bool ListInsertHead(Node* pNode);//在头部插入结点
	bool ListInsertTail(Node* pNode);//在末尾插入结点
private:
	Node* m_plist;
	//int m_iSize;//链表用不到
	int m_iLength;
};
#endif

功能实现

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

List::List()
{
	m_plist = new Node;
	m_plist->date = 0;
	m_plist->next = NULL;
	m_iLength = 0;//第一个节点不算在当前的链表当中（空的头结点）
}
List::~List()
{//释放所有节点
	ClearList();
	delete m_plist;
	m_plist = NULL;
}
void List::ClearList()
{//释放除头节点外的其他结点
	Node* currentNode= m_plist->next;
	while (currentNode != NULL)
	{//释放当前结点，currentNode指向下一个结点
		Node* temp = currentNode->next;
		delete currentNode;
		currentNode = temp;
	}
	m_plist->next = NULL;
}
bool List::ListEmpty()
{
	if (m_iLength == 0)	return true;
	else return false;
}
int List::ListLength()
{
	return m_iLength;
}
bool List::ListInsertHead(Node* pNode)
{
	Node* temp=m_plist->next;
	Node* newNode = new Node;
	if (newNode == NULL)	return false;
	newNode->date = pNode->date;
	m_plist->next = newNode;//如果没用temp保存m_plist->next地址的话
	newNode->next = temp;//需要换一下这两句的顺序
	/*newNode->next=m_plist->next; m_plist->next=newNode*/
	m_iLength++;
	return true;
}
bool List::ListInsertTail(Node* pNode)
{
	Node* currentNode = m_plist;
	while (currentNode->next != NULL)
	{
		currentNode = currentNode->next;
	}//调出while循环，此时的currentNode就是最后一个结点
	Node* newNode = new Node;
	if (newNode == NULL)	return false;
	newNode->date = pNode->date;
	newNode->next = NULL;
	currentNode->next = newNode;
	m_iLength++;
	return true;
}
bool List::ListInsert(int i, Node* pNode)
{//i=0插在头部,i=m_iLength插在尾部
	if (i<0 || i>m_iLength)	return false;
	Node* currentNode = m_plist;
	for (int k = 0; k < i; k++)
	{
		currentNode = currentNode->next;
	}//pNoide插在current Node之后（currentNode是待插入结点的前驱）
	Node* newNode = new Node;
	if (newNode == NULL) return false;
	newNode->date = pNode->date;
	newNode->next = currentNode->next;
	currentNode->next = newNode;//这两句不能调换
	return true;

}
bool List::ListDelete(int i, Node* pNode)
{
	if (i < 0 || i >= m_iLength)	return false;//
	Node* currentNode = m_plist;
	Node* currentNodeBefore = NULL;//需要找到上一个结点的前驱结点
	for (int k = 0; k <= i; k++)
	{
		//currentNode 就是待删除结点
		currentNodeBefore = currentNode;
		currentNode = currentNode->next;
	}
	currentNodeBefore->next = currentNode->next;
	pNode->date = currentNode->date;
	delete currentNode;
	currentNode = NULL;
	m_iLength--;
	return true;
}
bool List::GetElem(int i,Node* pNode)
{
	if (i<0 || i>m_iLength)	return false;
	Node* currentNode = m_plist;//头结点
	Node* currentNodeBefore = NULL;
	for (int k = 0; k <= i; k++)//头结点的下一个结点才是第0号结点
	{
		currentNodeBefore = currentNode;
		currentNode = currentNode->next;
	}
	pNode->date = currentNode->date;
	return true;
}
int List::LocateElem(Node* pNode)
{
	Node* currentNode = m_plist;
	int count = 0;
	while (currentNode->next != NULL)
	{
		currentNode = currentNode->next;
		if (currentNode->date == pNode->date)
		{
			return count;
		}
		count++;
	}//0 是head后的第一个结点
	return -1;//没找到
}
bool List::PreElem(Node* pCurrentNode,Node* pPreNode)
{
	Node* currentNode = m_plist;
	Node* tempNode = NULL;//currentNode 的前驱
	while (currentNode->next != NULL)
	{
		tempNode = currentNode;
		currentNode = currentNode->next;
		if (currentNode->date == pCurrentNode->date)
		{
			if (tempNode == m_plist)	return false;
			pPreNode->date = tempNode->date;
			return true;
		}
	}
	return false;
}
bool List::NextElem(Node* pCurrentNode, Node* pNextNode)
{
	Node* currentNode = m_plist;
	while (currentNode->next!=NULL)
	{
		currentNode = currentNode->next;
		if (currentNode->date == pCurrentNode->date)
		{
			if (currentNode->next == NULL)	return false;
			pNextNode->date = currentNode->next->date;
			return true;
		}
	}
	return false;
}
void List::ListTraval()
{
	Node* currentNode = m_plist;
	while (currentNode->next != NULL)
	{
		currentNode = currentNode->next;
		currentNode->printNode();
		//cout<<currentNode->date<<endl;
	}
}