linlisttest.cpp

来自「数据结构c++-书的一些源代码」· C++ 代码 · 共 29 行

#include <iostream.h>
#include <stdlib.h>

#include "LinList2.h"

void main(void)
{
	LinList<int> myList;
   	int s[] = {1,2,3,4,5,6,7,8,9,10}, n = 10;
	int temp;

    for(int i = 0; i < n; i++) 		//为链表赋值
		myList.Insert(s[i], i);

	myList.Delete(4);
	for(i = 0; i < myList.ListSize(); i++)		//测试Delete()和Insert()的最坏情况	
	{   
		temp = myList.GetData(i);
		cout << temp << "   ";
	}
	myList.Converse();
	cout << endl;
	for(i = 0; i < myList.ListSize(); i++)		//测试Delete()和Insert()的最坏情况	
	{   
		temp = myList.GetData(i);
		cout << temp << "   ";
	}
}