实验报告4：群体类和群体数据(2)

if (prevPtr == NULL) InsertFront(head,item); else {

newNode = GetNode(item);

prevPtr->InsertAfter(newNode); } }

template

void ClearList(Node * &head) {

Node *currPtr, *nextPtr; currPtr = head; while(currPtr != NULL) {

nextPtr = currPtr->NextNode(); delete currPtr; currPtr = nextPtr; }

head = NULL; }

#endif

#include #include \#include %using namespace std; int main() {

Node *head = NULL, *prevPtr, *delPtr; int i, key, item;

for (i=0;i < 10;i++) {

cin>>item;

InsertFront(head, item); }

cout << \

PrintList(head,noNewline); cout << endl;

cout << \请输入一个需要删除的整数: \ cin >> key;

prevPtr = head;

while (Find(head,key,prevPtr) != NULL) {

if(prevPtr == NULL)

6

head = head->NextNode(); else

delPtr=prevPtr->DeleteAfter(); delete delPtr; }

cout << \

PrintList(head,noNewline); cout << endl; ClearList(head); } 2、

#include \int main() {

LinkedList A, B; for(int i=0;i<5;i++) {

A.InsertRear(2*i+1); B.InsertRear(2*i+2); }

A.Reset();

cout << \链表A的元素为：\ while(!A.EndOfList()) {

cout << A.Data() << \ A.Next(); }

cout << endl; B.Reset();

cout << \链表B的元素为：\ while(!B.EndOfList()) {

cout << B.Data() << \ B.Next(); }

cout << endl;

cout << \把B中的元素插入A中...\ B.Reset();

while(!B.EndOfList()) {

A.InsertRear(B.Data()); B.Next(); }

A.Reset();

7

cout << \此时，链表A的元素为：\ while(!A.EndOfList()) {

cout << A.Data() << \ A.Next(); }

cout << endl; }

#ifndef LINKEDLIST_CLASS #define LINKEDLIST_CLASS #include #include using namespace std; #ifndef NULL

const int NULL = 0; #endif // NULL #include \template class LinkedList {

private:

Node *front, *rear;

Node *prevPtr, *currPtr; int size; int position;

Node *GetNode(const T& item,Node *ptrNext=NULL); void FreeNode(Node *p);

void CopyList(const LinkedList& L); public:

LinkedList(void);

LinkedList(const LinkedList& L); ~LinkedList(void);

LinkedList& operator= (const LinkedList& L); int ListSize(void) const; int ListEmpty(void) const; void Reset(int pos = 0); void Next(void);

int EndOfList(void) const;

int CurrentPosition(void) const; void InsertFront(const T& item); void InsertRear(const T& item); void InsertAt(const T& item); void InsertAfter(const T& item); T DeleteFront(void);

8

void DeleteAt(void); T& Data(void); void ClearList(void); };

template

Node *LinkedList::GetNode(const T& item, Node* ptrNext) {

Node *p;

p = new Node(item,ptrNext); if (p == NULL) {

cout << \ exit(1); }

return p; }

template

void LinkedList::FreeNode(Node *p) {

delete p; }

template

void LinkedList::CopyList(const LinkedList& L) {

Node *p = L.front; int pos;

while (p != NULL) {

InsertRear(p->data); p = p->NextNode(); }

if (position == -1) return;

prevPtr = NULL; currPtr = front;

for (pos = 0; pos != position; pos++) {

prevPtr = currPtr;

currPtr = currPtr->NextNode(); } }

template

LinkedList::LinkedList(void): front(NULL), rear(NULL),

9

prevPtr(NULL),currPtr(NULL), size(0), position(-1) {}

template

LinkedList::LinkedList(const LinkedList& L) {

front = rear = NULL;

prevPtr = currPtr = NULL; size = 0;

position = -1; CopyList(L); }

template

void LinkedList::ClearList(void) {

Node *currPosition, *nextPosition; currPosition = front;

while(currPosition != NULL) {

nextPosition = currPosition->NextNode(); FreeNode(currPosition);

currPosition = nextPosition; }

front = rear = NULL;

prevPtr = currPtr = NULL; size = 0;

position = -1; }

template

LinkedList::~LinkedList(void) {

ClearList(); }

template

LinkedList& LinkedList::operator=(const LinkedList& L) {

if (this == &L) return *this; ClearList(); CopyList(L); return *this; }

template

int LinkedList::ListSize(void) const {

10

百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读，免费范文网，提供经典小说综合文库实验报告4：群体类和群体数据(2)在线全文阅读。