dlist.cpp

来自「一本全面剖析C++数据结构算法的书籍」· C++ 代码 · 共 19 行

#include<iostream.h>
#include "dlist.h"
void main(void)
{
int x;
LinearList<int> L(5);
cout << "Length = " << L.Length() << endl;
cout << "IsEmpty = " << L.IsEmpty() << endl;
L.Insert(0,2).Insert(1,6);
cout << "List is " << L << endl;
cout << "IsEmpty = " << L.IsEmpty() << endl;
L.Find(1,x);
cout << "First element is " << x << endl;
cout << "Length = " << L.Length() << endl;
L.Delete(1,x);
cout << "Deleted element is " << x << endl;
cout << "List is " << L << endl;
}