学步园

#include <iostream></p> <p>#define OVERFLOW -1<br /> #define OK 1<br /> #define ERROR 0 </p> <p>typedef int Status;</p> <p>using namespace std;</p> <p>/* 定义链表节点 */<br /> typedef struct Node<br /> {<br /> int data;<br /> struct Node *next;<br /> }Node, *LinkList;</p> <p>/* 初始化链表，即安排一个头结点 */<br /> Status init(LinkList &l)<br /> {<br /> l = (LinkList)malloc(sizeof(Node));<br /> if(!l)exit(OVERFLOW);<br /> l ->next = NULL;<br /> return OK;<br /> }</p> <p>/* 添加一个节点在头部后面 */<br /> Status addNode(LinkList &l, int data)<br /> {<br /> if(l == NULL)init(l);<br /> Node *n = NULL;<br /> init(n);<br /> n ->data = data;<br /> n ->next = l ->next;<br /> l ->next = n;<br /> printf("%s/n", "节点添加成功!");<br /> return OK;<br /> }</p> <p>/* 得到链表的长度 */<br /> int getLength(LinkList &l)<br /> {<br /> int length = 0;<br /> if(l == NULL || l ->next == NULL)return length;<br /> Node *n = l ->next;<br /> while(n != NULL)<br /> {<br /> ++length;<br /> n = n ->next;<br /> }<br /> return length;<br /> }</p> <p>/* 在链表的某个位置插入一个元素,前提是链表中已经有节点 */<br /> Status insertNode(LinkList &l, int position, int data)<br /> {<br /> int length = getLength(l);<br /> if(position < 1 || position > length)<br /> {<br /> printf("%s/n", "保证链表存在结点才可以插入!");<br /> return ERROR;<br /> }</p> <p> int curPosition = 0;<br /> Node *n= l;<br /> while(n != NULL && curPosition < position - 1)<br /> {<br /> n = n ->next;<br /> ++curPosition;<br /> }<br /> // 此时的n正好是即将插入的位置的之前节点</p> <p> Node *insertNode = (Node*)malloc(sizeof(Node));<br /> if(!insertNode)exit(OVERFLOW);<br /> insertNode ->data = data;<br /> insertNode ->next = n ->next;<br /> n ->next = insertNode;<br /> printf("%s/n", "插入成功!");<br /> return OK;<br /> }</p> <p>/* 从链表上删除某位置的节点，并且用data返回对应节点的数据 */<br /> Status deleteNode(LinkList &l, int position, int &data)<br /> {<br /> int length = getLength(l);<br /> if(position < 1 || position > length)<br /> {<br /> printf("%s/n", "保证链表存在结点才可以删除!");<br /> return ERROR;<br /> }</p> <p> int curPosition = 0;<br /> Node *n= l;<br /> while(n != NULL && curPosition < position - 1)<br /> {<br /> n = n ->next;<br /> ++curPosition;<br /> }<br /> // 此时的n正好是即将删除的位置的之前节点</p> <p> Node *deleNode = n ->next;<br /> n ->next = n ->next ->next;<br /> data = deleNode ->data;<br /> free(deleNode);<br /> printf("%s%d/n", "删除成功，删除节点的数据为:", data);<br /> return OK;<br /> }</p> <p>/* 打印链表 */<br /> void print(LinkList &l)<br /> {<br /> if(l == NULL)<br /> {<br /> printf("%s/n", "链表还没有初始化!");<br /> return;<br /> }<br /> if( l ->next == NULL)<br /> {<br /> printf("%s/n", "链表只有头结点!");<br /> return;<br /> }<br /> Node *n = l ->next;<br /> while(n != NULL)<br /> {<br /> printf("%d -> ", n ->data);<br /> n = n ->next;<br /> }<br /> printf("%s/n", "");<br /> }</p> <p>/* 主函数，操作 */<br /> void main()<br /> {<br /> LinkList list = NULL;<br /> int r = -1;<br /> while(r != 0)<br /> {<br /> printf("%s/n", "1:初始化链表");<br /> printf("%s/n", "2:在头部后面添加一个节点");<br /> printf("%s/n", "3:打印链表");<br /> printf("%s/n", "4:在位置i添加节点");<br /> printf("%s/n", "5:删除位置i上的节点");<br /> scanf("%d", &r);</p> <p> switch(r)<br /> {<br /> case 1:<br /> init(list);<br /> printf("%s/n", "初始化完毕!");<br /> break;<br /> case 2:<br /> int data;<br /> printf("%s", "请输入节点数据:");<br /> scanf("%d", &data);<br /> addNode(list, data);<br /> break;<br /> case 3:<br /> print(list);<br /> break;<br /> case 4:<br /> int position;<br /> printf("%s", "请输入位置和数据(空格隔开):");<br /> scanf("%d%d", &position, &data);<br /> insertNode(list, position, data);<br /> break;<br /> case 5:<br /> int delPosition;<br /> printf("%s", "请输入位置:");<br /> scanf("%d", &delPosition);<br /> deleteNode(list, delPosition, data);<br /> break;<br /> }<br /> }</p> <p>}