多重继承.cpp

JICHERNG继承的实现

// 多重继承.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "LinkList.h"
#include "Stack.h"
#include "Queue.h"

int main(int argc, char* argv[])
{
    Queue *q1 = new Queue;
	Stack *s1 = new Stack;

	//输出总的列表数
	cout << "Total Lists:" << LinkList::getListNumber() << endl;
	
	//在队列和栈中加入元素
	for (int i = 0; i < 4; i++)
	{
		q1->EnterQueque(i);
		s1->EnterStack(i);
	}

	//输出队列长度和队列中的元素个数
	cout << "Queue length:" << q1->GetLength() << endl;
	q1->printQueue();

	//输出栈的内容
	cout << "Stack top: " << s1->peekTop() << endl;
	s1->printStack();

	//取出队列和栈中的元素
	for (i = 0; i < 4; i++)
	{
		q1->PopQueue();
		s1->QuitStack();
	}

	//输出队列长度
	cout << "Queue length:" << q1->GetLength() << endl;
	//检查栈是否为空
	cout << "Stack empty:";
	if (s1->empty())
		cout << "Yes";
	else
		cout << "No";	 
	cout << endl;

	delete q1;
	delete s1;

	//输出总的列表数
	cout << "Total Lists:" << LinkList::getListNumber() << endl;


/*	Queue qu;
	qu.EnterQueque(0);
	qu.EnterQueque(1);
	qu.EnterQueque(2);
	qu.EnterQueque(3);

	qu.printQueue();

	Stack st;
	st.EnterStack(0);
	st.EnterStack(1);
	st.EnterStack(2);
	st.EnterStack(3);

	st.printStack();

	cout<<"All list number is:"<<endl;
	cout<<LinkList::getListNumber();
	*/


/*
	LinkList ls;
	ls.putHead(1);
	ls.putHead(2);
	if(ls.empty()) cout<<"No"<<endl;
	else cout<<"Yes"<<endl;

	cout<<ls.peekHead()<<endl;
*/

	return 0;
}