链表

// TestList.cpp : 定义控制台应用程序的入口点。
//


#include "stdafx.h"
#include <iostream>
using namespace std;
enum 
{
small,
large,
same
};
//数据类
class Date
{
public:
Date(int i):date(i){}
~Date(){}
int compare(const Date&);
int compare(const int&);
void print(){cout<<date<<endl;}
private:
int date;
};
int Date::compare(const Date &two)
{
if (date < two.date)
return small;
if (date > two.date)
return large;
return same;
}
int Date::compare(const int &two)
{
if (date < two)
return small;
if (date > two)
return large;
return same;
}


//抽象类(接口类)
class Node
{
public:
//Node(){}
virtual ~Node(){}
virtual Node* insert(Date *one) = 0;
virtual Node* deleteNode(int num) = 0;
virtual void print()=0;
};
//链表由标签,头结点,尾节点,中间节点
//整个链表只有中间节点保存数据
//头结点用来创建尾节点并将数据传递到尾节点然后由尾节点创建一个中间节点
//头结点类
class InterNode:public Node
{
public:
InterNode(Date *one,Node *t):thisdate(one),next(t){}
void print(){thisdate->print();next->print();}
Node* insert(Date *one);
Node* deleteNode(int num);
~InterNode(){delete next;delete thisdate;}
private:
Date *thisdate;
Node *next;
};
Node* InterNode::insert(Date *one)
{
int result = thisdate->compare(*one);
switch (result)
{
case same:
case large:
{
InterNode *nodeDate = new InterNode(one,this);
return nodeDate;
}
case small:
{
next = next->insert(one);
return this;
}
default:
break;
}
return this;
}
Node* InterNode::deleteNode(int num)
{
int result = thisdate->compare(num);
switch (result)
{
case same:
{
cout<<"找到要删除的"<<endl;
return next;
}
case large:
case small:
{
cout<<"找不到要删除的"<<endl;
next = next->deleteNode(num);
return this;
}
default:
break;
}
return this;
}
class TailNode:public Node
{
public:
Node *insert(Date *one);
Node* deleteNode(int num);
void print(){}
};
Node* TailNode::insert(Date *one)
{
InterNode *datenode = new InterNode(one,this);
return datenode;
}
Node* TailNode::deleteNode(int num)
{
return this;
}
class HeadNode:public Node
{
public:
HeadNode();
~HeadNode(){delete next;}
Node *insert(Date *one);
Node* deleteNode(int num);
void print(){next->print();}
private:
//指向基类的指针主要是为实现动态联编
Node *next;
};
HeadNode::HeadNode()
{
next = new TailNode;
}
Node* HeadNode::insert(Date *one)
{
next = next->insert(one);
return this;
}
Node* HeadNode::deleteNode(int num)
{
next = next->deleteNode(num);
return this;
}
//label类
class Label
{
public:
Label();
~Label();
void insert(Date *one);
void deleteNode(int num);
//输出头结点钟保存的数据
void printtall(){head->print();}
private:
HeadNode *head;
};
Label::Label()
{
//创建一个头结点
head = new HeadNode;
}
Label::~Label()
{
//删除头结点
delete head;
}
void Label::insert(Date *one)
{
//将数据插入到头结点
head->insert(one);
}
void Label::deleteNode(int num)
{
head->deleteNode(num);
}


int _tmain(int argc, _TCHAR* argv[])
{
cout<<"面向对象的思想创建链表"<<endl;
Label *label = new Label;
Date *date1 = new Date(10);
label->insert(date1);
Date *date2 = new Date(100);
label->insert(date2);
Date *date3 = new Date(1000);
label->insert(date3);
label->insert(new Date(23));
label->printtall();
cout<<"删除节点"<<endl;
label->deleteNode(23);
label->printtall();
delete label;
system("PAUSE");
return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值