双向链表实列
来源:互联网 发布:淘宝店铺年度计划表 编辑:程序博客网 时间:2024/05/17 09:04
/*双向链表
*易甫 Nightiger (jianan12@gmail.com) Graduate University of Chinese Academy
*/
#include <stdlib.h>
template<class T> class flistnode //双向链表节点
{
public:
T data;
flistnode<T>* next;
flistnode<T>* prev;
};
template<class T> class flist
{
flistnode<T>* ptr_head; //指向链表的头节点
flistnode<T>* ptr_cur; //指向当前的节点,实际上有指向末尾节点的意思
size_t size;
public:
void push_cur(T val); //在当前位置后插入
void push_head(T val); //在头节点前置插入
void pop_cur();
void pop_head();
flist(){
ptr_head=NULL;
size=0;
};
//针赋值为NULL对析构比较总要
~flist()
{
flistnode<T> * ptr;
while (ptr_cur->prev!=NULL)
{
ptr=ptr_cur;
ptr_cur=ptr_cur->prev;
delete ptr;
}
delete ptr_head;
//to free the memory!
};
};
template<class T> void flist<T>::push_cur(T val)
{
flistnode<T> * ptr_newnode =new flistnode<T>;
ptr_newnode->data=val;
ptr_newnode->next=NULL;
ptr_newnode->prev=NULL;
if (ptr_head==NULL)
{
ptr_head=ptr_cur=ptr_newnode;
size++;
}
else
{
ptr_cur->next=ptr_newnode; /**/
ptr_newnode->prev=ptr_cur; /**/
ptr_cur=ptr_newnode; /**/
size++;
}
}
template<class T> void flist<T>::push_head(T val)
{
flistnode<T> * ptr_newnode =new flistnode<T>;
ptr_newnode->data=val;
ptr_newnode->next=NULL;
ptr_newnode->prev=NULL;
if (ptr_head==NULL)
{
ptr_head=ptr_cur=ptr_newnode;
size++;
}
else
{
ptr_newnode->next=ptr_head; /**/
ptr_head->prev=ptr_newnode; /**/
ptr_head=ptr_newnode; /**/
size++;
}
}
template<class T> void flist<T>::pop_cur()
{
flistnode<T>* ptr_tmp=ptr_cur;
ptr_cur=ptr_cur->prev;
ptr_cur->next=NULL;
delete ptr_tmp;
size--;
}
template<class T> void flist<T>::pop_head()
{
flistnode<T>* ptr_tmp = ptr_head;
ptr_head=ptr_head->next;
ptr_head->prev=NULL;//This is important
delete ptr_tmp;
size--;
}
*易甫 Nightiger (jianan12@gmail.com) Graduate University of Chinese Academy
*/
#include <stdlib.h>
template<class T> class flistnode //双向链表节点
{
public:
T data;
flistnode<T>* next;
flistnode<T>* prev;
};
template<class T> class flist
{
flistnode<T>* ptr_head; //指向链表的头节点
flistnode<T>* ptr_cur; //指向当前的节点,实际上有指向末尾节点的意思
size_t size;
public:
void push_cur(T val); //在当前位置后插入
void push_head(T val); //在头节点前置插入
void pop_cur();
void pop_head();
flist(){
ptr_head=NULL;
size=0;
};
//针赋值为NULL对析构比较总要
~flist()
{
flistnode<T> * ptr;
while (ptr_cur->prev!=NULL)
{
ptr=ptr_cur;
ptr_cur=ptr_cur->prev;
delete ptr;
}
delete ptr_head;
//to free the memory!
};
};
template<class T> void flist<T>::push_cur(T val)
{
flistnode<T> * ptr_newnode =new flistnode<T>;
ptr_newnode->data=val;
ptr_newnode->next=NULL;
ptr_newnode->prev=NULL;
if (ptr_head==NULL)
{
ptr_head=ptr_cur=ptr_newnode;
size++;
}
else
{
ptr_cur->next=ptr_newnode; /**/
ptr_newnode->prev=ptr_cur; /**/
ptr_cur=ptr_newnode; /**/
size++;
}
}
template<class T> void flist<T>::push_head(T val)
{
flistnode<T> * ptr_newnode =new flistnode<T>;
ptr_newnode->data=val;
ptr_newnode->next=NULL;
ptr_newnode->prev=NULL;
if (ptr_head==NULL)
{
ptr_head=ptr_cur=ptr_newnode;
size++;
}
else
{
ptr_newnode->next=ptr_head; /**/
ptr_head->prev=ptr_newnode; /**/
ptr_head=ptr_newnode; /**/
size++;
}
}
template<class T> void flist<T>::pop_cur()
{
flistnode<T>* ptr_tmp=ptr_cur;
ptr_cur=ptr_cur->prev;
ptr_cur->next=NULL;
delete ptr_tmp;
size--;
}
template<class T> void flist<T>::pop_head()
{
flistnode<T>* ptr_tmp = ptr_head;
ptr_head=ptr_head->next;
ptr_head->prev=NULL;//This is important
delete ptr_tmp;
size--;
}
- 双向链表实列
- 双向排序
- 双向容器
- 双向冒泡
- 双向可控硅
- 双向排序
- 双向排序
- 双向BFS
- 双向加密
- 双向加密算法
- 双向队列
- many2many 双向
- 双向端口
- 双向BFS
- 双向迪杰斯特拉
- 双向BFS
- 双向队列
- 双向冒泡
- 参加acm竞赛后记
- 几个泛型编程算法
- BT是如何采用激励机制来达到健壮性的
- BT运行期行为
- 最强的力量来自于--------团队合作!!!
- 双向链表实列
- IP地址精解(经典.小菜鸟收藏学习)
- Python实列:计时器调用
- 电脑族吃什么比较好
- 《Thinking in C++》练习题答案——2-7
- 只需900分钟,你就可以创造出美妙的音乐[转]
- Linux_第1章 Linux入门
- 默然周记20070523
- 浑浑噩噩的大三