数据结构探险（三）线性表篇

一、线性表的概念及工作原理

线性表是N个数据元素的有限序列

            

二、顺序表的基本操作实战

//在List.h文件中
#ifndef LIST_H
#define LIST_H

class List
{
public:
	List(int size);
	~List();
	void ClearList();
	bool ListEmpty();
	int ListLength();
	bool GetElem(int i,int *e);
	int LocateElem(int *e);
	bool PriorElem(int *currentElem, int *preElem);
	bool NextElem(int *currentElem, int *nextElem);
	void ListTraverse();
	bool ListInsert(int i, int *e);
	bool ListDelete(int i, int*e);
private:
	int *m_pList;
	int m_iSize;
	int m_iLength;
};

#endif // !LIST_H

//List.cpp文件中
#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;
	return false;
}

int List::ListLength()
{
	return m_iLength;
}

bool List::GetElem(int i, int *e)
{
	if (i < 0 || i < m_iSize)
	{
		return false;
	}
	*e = m_pList[i];
	return true;
}
int List::LocateElem(int *e)
{
	for (int i = 0; i < m_iLength; i++)
	{
		if (*e == m_pList[i])
		{
			return i;
		}
	}
	return -1;
}

bool List::PriorElem(int *currentElem, int *preElem)
{
	int temp = LocateElem(currentElem);
	if (temp == -1)
	{
		return false;
	}
	else
	{
		if (temp == 0)
		{
			return false;
		}
		else 
		{
			*preElem = m_pList[temp - 1];
			return true;
		}
	}
}

bool List::NextElem(int *currentElem, int *nextElem)
{
	int temp = LocateElem(currentElem);
	if (temp == -1)
	{
		return false;
	}
	else
	{
		if (temp == m_iLength-1)
		{
			return false;
		}
		else
		{
			*nextElem = m_pList[temp + 1];
			return true;
		}
	}
}
void List::ListTraverse()
{
	for (int i = 0; i < m_iLength; i++)
	{
		cout << m_pList[i] << endl;
	}
}

bool List::ListInsert(int i, int *e)
{
	if (i<0 || i>m_iLength)
		return false;
	for (int k = m_iLength-1; k >= i; k--)
	{
		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 + 1; k < m_iLength; k++)
	{
		m_pList[k-1] = m_pList[k];
	}
	m_iLength--;
	return true;
}

三、链表的基本操作实战

四、链表应用——通讯录