登 录
<br /> #ifndef _LINKLIST_H_<br /> #define _LINKLIST_H_</p> <p>typedef void LinkList;<br /> typedef struct _tag_LinkListNode LinkListNode;<br /> struct _tag_LinkListNode<br /> {<br /> LinkListNode* next;<br /> };</p> <p>LinkList* LinkList_Create();</p> <p>void LinkList_Destroy(LinkList* list);</p> <p>void LinkList_Clear(LinkList* list);</p> <p>int LinkList_Empty(LinkList* list);</p> <p>int LinkList_Length(LinkList* list);</p> <p>int LinkList_Insert(LinkList* list, LinkListNode* node, int pos);</p> <p>LinkListNode* LinkList_Get(LinkList* list, int pos);</p> <p>LinkListNode* LinkList_Delete(LinkList* list, int pos);</p> <p>#endif</p> <p><br /> #include <stdio h=""><br /> #include <malloc h=""><br /> #include "LinkList.h"<br /> typedef struct _tag_LinkList<br /> {<br /> LinkListNode header;<br /> int length;<br /> } TLinkList;<br /> LinkList* LinkList_Create()<br /> {<br /> TLinkList* ret = (TLinkList*)malloc(sizeof(TLinkList));<br /> if(ret != NULL)<br /> {<br /> ret->header.next = NULL;<br /> ret->length = 0;<br /> }<br /> return ret;<br /> }</p> <p>void LinkList_Destroy(LinkList* list)<br /> {<br /> free(list);<br /> }</p> <p>void LinkList_Clear(LinkList* list)<br /> {<br /> TLinkList* slist = (TLinkList*)list;<br /> if(slist != NULL)<br /> {<br /> slist->header.next = NULL;<br /> slist->length = 0;<br /> }<br /> }<br /> int LinkList_Empty(LinkList* list)<br /> {<br /> TLinkList* slist = (TLinkList*)list;<br /> int ret = 0;<br /> if((slist != NULL) && (slist->length == 0))<br /> {<br /> ret = 1;<br /> }<br /> return ret;<br /> }<br /> int LinkList_Length(LinkList* list)<br /> {<br /> TLinkList* slist = (TLinkList*)list;<br /> int ret = -1;<br /> if(slist != NULL)<br /> {<br /> ret = slist->length;<br /> }<br /> return ret;<br /> }</p> <p>int LinkList_Insert(LinkList* list, LinkListNode* node, int pos)<br /> {<br /> TLinkList* slist = (TLinkList*)list;</p> <p> int i = 0;<br /> int ret = (slist != NULL) && (0 <= pos);</p> <p> if(ret)<br /> {<br /> LinkListNode* current = (LinkListNode*)slist;<br /> for(i=0;(i < pos) && (current->next != NULL);i++)<br /> {<br /> current = current->next;<br /> }<br /> node->next = current->next;<br /> current->next = node;<br /> slist->length++;<br /> }<br /> return ret;<br /> }</p> <p>LinkListNode* LinkList_Get(LinkList* list, int pos)<br /> {<br /> TLinkList* slist = (TLinkList*)list;<br /> LinkListNode* ret = NULL;<br /> int i = 0;<br /> if((0 <= pos) && (pos < slist->length))<br /> {<br /> LinkListNode* current = (LinkListNode*)slist;<br /> for(i=0;i <pos i="" current="current-">next;<br /> }<br /> ret = current->next;<br /> }<br /> return ret;<br /> }</p> <p>LinkListNode* LinkList_Delete(LinkList* list, int pos)<br /> {<br /> TLinkList* slist = (TLinkList*)list;<br /> LinkListNode* ret = NULL;<br /> int i = 0;<br /> if((slist != NULL) && (0 <= pos) && (pos < slist->length))<br /> {<br /> LinkListNode* current = (LinkListNode*)slist;<br /> for(i=0;i <pos i="" current="current-">next;<br /> }<br /> ret = current->next;<br /> current->next = ret->next;<br /> slist->length--;<br /> }<br /> return ret;<br /> } </pos></pos></malloc></stdio><br /> #ifndef _LINKSTACK_H_<br /> #define _LINKSTACK_H_</p> <p>typedef void LinkStack;</p> <p>LinkStack* LinkStack_Create();</p> <p>void LinkStack_Destroy(LinkStack* stack);</p> <p>void LinkStack_Clear(LinkStack* stack);</p> <p>int LinkStack_Empty(LinkStack* stack);</p> <p>int LinkStack_Push(LinkStack* stack,void* item);</p> <p>void* LinkStack_Pop(LinkStack* stack);</p> <p>void* LinkStack_Top(LinkStack* stack);</p> <p>int LinkStack_Size(LinkStack* stack);</p> <p>#endif<br /> <br /> #include <malloc h=""><br /> #include "LinkStack.h"<br /> #include "LinkList.h"</p> <p>typedef struct _tag_LinkStack<br /> {<br /> LinkListNode header;<br /> void* item;<br /> } TLinkStackNode;</p> <p>LinkStack* LinkStack_Create()<br /> {<br /> return LinkList_Create();<br /> }<br /> void LinkStack_Destroy(LinkStack* stack)<br /> {<br /> LinkStack_Clear(stack);<br /> LinkList_Destroy(stack);<br /> }</p> <p>void LinkStack_Clear(LinkStack* stack)<br /> {<br /> while(LinkStack_Size(stack)>0)<br /> {<br /> LinkStack_Pop(stack);<br /> }<br /> }</p> <p>int LinkStack_Empty(LinkStack* stack)<br /> {<br /> return LinkList_Empty(stack);<br /> }</p> <p>int LinkStack_Push(LinkStack* stack,void* item)<br /> {<br /> TLinkStackNode* node = (TLinkStackNode*)malloc(sizeof(TLinkStackNode));<br /> int ret = 0;<br /> if((node != NULL) && (item !=NULL))<br /> {<br /> node->item = item;<br /> ret = LinkList_Insert(stack,(LinkListNode*)node,0);<br /> }<br /> if(!ret)<br /> {<br /> free(node);<br /> }<br /> return ret;<br /> }</p> <p>void* LinkStack_Pop(LinkStack* stack)<br /> {<br /> TLinkStackNode* node =(TLinkStackNode*)LinkList_Delete(stack,0);<br /> void* ret = NULL;<br /> if( node != NULL)<br /> {<br /> ret = node->item;<br /> free(node);<br /> }<br /> return ret;</p> <p>}</p> <p>void* LinkStack_Top(LinkStack* stack)<br /> {<br /> TLinkStackNode* node =(TLinkStackNode*)LinkList_Get(stack,0);<br /> void* ret = NULL;<br /> if( node != NULL)<br /> {<br /> ret = node->item;<br /> }<br /> return ret;<br /> }</p> <p>int LinkStack_Size(LinkStack* stack)<br /> {<br /> return LinkList_Length(stack);<br /> }</p> <p></malloc><br /> #include <stdio h=""><br /> #include <stdlib h=""><br /> #include "LinkStack.h"<br /> /* run this program using the console pauser or add your own getch, system("pause") or input loop */</p> <p>int main(int argc, char *argv[])<br /> {<br /> LinkStack* stack = LinkStack_Create();<br /> int i = 0;<br /> int a[10]={0};<br /> for(i=0;i<10;i++)<br /> {<br /> a[i] = i;<br /> LinkStack_Push(stack,a+i);<br /> }<br /> printf("the stack length is %d\n",LinkStack_Size(stack));<br /> printf("the first elem is %d\n",*(int*)LinkStack_Top(stack));<br /> for(i=0;i<10;i++)<br /> {<br /> int* p = (int*)LinkStack_Pop(stack);<br /> printf("the elem is %d\n",*p);<br /> }<br /> printf("the stack is Empty(%d)\n",LinkStack_Empty(stack));<br /> LinkStack_Destroy(stack);<br /> return 0;<br /> }</p> <p></stdlib></stdio>
抱歉!评论已关闭.