双向链表
来源:互联网 发布:上海java培训哪家好 编辑:程序博客网 时间:2024/06/01 13:07
#include<iostream>
using namespace std;
#define Elemtype int
#define INIT_SIZE 10
typedef struct node
{
Elemtype data;
node* prior;
node* later;
}node,*pnode;
pnode init_list()
{
pnode head;
head = (pnode)malloc(sizeof(node));
head->prior = NULL;
head->later = NULL;
return head;
}
pnode s_malloc()
{
pnode node = (pnode)malloc(sizeof(node));
return node;
}
void create_list(pnode& head, int size)
{
pnode prior;
prior = head;
for (int i = 0; i < size; i++)
{
pnode node;
node = s_malloc();
prior->later = node;
node->prior = prior;
node->data = i;
node->later = NULL;
prior = node;
}
}
bool node_insert(pnode head,int loc,int val)
{
int i = 1;
pnode node;
node=head;
pnode insert_node = s_malloc();
insert_node->data = val;
if (loc < i)
return false;
else
{
while (node != NULL&&i < loc)
{
node = node->later;
i++;
}
if (node == NULL)
{
return false;
}
else
{
insert_node->later = node->later;
node->later->prior = insert_node;
node->later = insert_node;
insert_node->prior = node;
}
}
}
bool node_delete(pnode& head, int loc)
{
pnode node = head;
int i = 1;
if (loc < i)
return false;
else
{
while (node != NULL&&i <= loc)
{
node = node->later;
i++;
}
if (node != NULL)
{
node->prior->later = node->later;
node->later->prior = node->prior;
free(node);
return true;
}
else
return false;
}
}
int main()
{
pnode head;
head=init_list();
pnode temp = head;
create_list(head, INIT_SIZE);
for (int i = 0; i < INIT_SIZE; i++)
{
cout << temp->later->data<<' ';
temp = temp->later;
}
node_insert(head, 3, 100);
node_delete(head, 3);
return 0;
}
using namespace std;
#define Elemtype int
#define INIT_SIZE 10
typedef struct node
{
Elemtype data;
node* prior;
node* later;
}node,*pnode;
pnode init_list()
{
pnode head;
head = (pnode)malloc(sizeof(node));
head->prior = NULL;
head->later = NULL;
return head;
}
pnode s_malloc()
{
pnode node = (pnode)malloc(sizeof(node));
return node;
}
void create_list(pnode& head, int size)
{
pnode prior;
prior = head;
for (int i = 0; i < size; i++)
{
pnode node;
node = s_malloc();
prior->later = node;
node->prior = prior;
node->data = i;
node->later = NULL;
prior = node;
}
}
bool node_insert(pnode head,int loc,int val)
{
int i = 1;
pnode node;
node=head;
pnode insert_node = s_malloc();
insert_node->data = val;
if (loc < i)
return false;
else
{
while (node != NULL&&i < loc)
{
node = node->later;
i++;
}
if (node == NULL)
{
return false;
}
else
{
insert_node->later = node->later;
node->later->prior = insert_node;
node->later = insert_node;
insert_node->prior = node;
}
}
}
bool node_delete(pnode& head, int loc)
{
pnode node = head;
int i = 1;
if (loc < i)
return false;
else
{
while (node != NULL&&i <= loc)
{
node = node->later;
i++;
}
if (node != NULL)
{
node->prior->later = node->later;
node->later->prior = node->prior;
free(node);
return true;
}
else
return false;
}
}
int main()
{
pnode head;
head=init_list();
pnode temp = head;
create_list(head, INIT_SIZE);
for (int i = 0; i < INIT_SIZE; i++)
{
cout << temp->later->data<<' ';
temp = temp->later;
}
node_insert(head, 3, 100);
node_delete(head, 3);
return 0;
}
阅读全文
0 0
- SzNOI 双向约瑟夫(双向链表)
- 双向链表&&堆栈
- 双向链表
- 使用双向链表
- 双向链表
- 双向循环链表
- 双向循环链表
- 双向链表
- 实现双向链表
- 双向循环链表
- 建立双向链表
- 双向链表
- 双向链表
- 双向循环链表
- 双向链表
- 链表-双向链表
- 双向链表
- 双向动态链表
- 网络安全组(NSG)简介
- 『机器学习实战』使用朴素贝叶斯过滤垃圾邮件
- Java、web的一些面试知识点总结
- 老郭的《Dalvik虚拟机垃圾收集(GC)过程分析》
- mysql基础,新建数据库,新建表
- 双向链表
- Android KeyCode列表
- 3S基础知识:MapX应用教程—查询
- GitHub for Windows提交失败“failed to sync this branch”
- 第八周项目二
- 功能完整的js原生轮播图
- AndoridO hidl
- MFC中基于OpenCV实现Picture Control控件成像方法
- apache配置多域名站点和多端口站点