Data Structure - List Stack (C)

àì夳堔傛蜴生んèń 2023-01-17 06:22 275阅读 0赞

分享一个大牛的人工智能教程。零基础！通俗易懂！风趣幽默！希望你也加入到人工智能的队伍中来！请点击http://www.captainbed.net

  1. /*
  2.  * Fatal.h - by FreeMan
  3.  */
  5. #include <stdio.h>
  6. #include <stdlib.h>
  8. #define Error( Str )        FatalError( Str )
  9. #define FatalError( Str )   fprintf( stderr, "%s\n", Str ), exit( 1 )
  11. /*
  12.  * LiStack.h - by FreeMan
  13.  */
  15. typedef int ElementType;
  17. #ifndef _LiStack_H_
  18. #define _LiStack_H_
  20. struct LiStackNode;
  21. typedef struct LiStackNode *PtrToNode;
  22. typedef PtrToNode LiStack;
  24. int IsLiStackEmpty(LiStack S);
  25. LiStack CreateLiStack(void);
  26. void DisposeLiStack(LiStack S);
  27. void MakeLiStackEmpty(LiStack S);
  28. void PushLiStack(ElementType X, LiStack S);
  29. ElementType TopOfLiStack(LiStack S);
  30. void PopLiStack(LiStack S);
  32. #endif
  34. /*
  35.  * LiStack.c - by FreeMan
  36.  */
  38. #include "LiStack.h"
  39. #include "..\Fatal.h"
  40. #include <stdlib.h>
  42. struct LiStackNode
  43. {
  44.     ElementType Element;
  45.     PtrToNode   Next;
  46. };
  48. int IsLiStackEmpty(LiStack S)
  49. {
  50.     return S->Next == NULL;
  51. }
  53. LiStack CreateLiStack(void)
  54. {
  55.     LiStack S;
  57.     S = malloc(sizeof(struct LiStackNode));
  58.     if (S == NULL)
  59.     {
  60.         FatalError("Out of memory!!");
  61.     }
  62.     S->Next = NULL;
  63.     MakeLiStackEmpty(S);
  64.     return S;
  65. }
  67. void MakeLiStackEmpty(LiStack S)
  68. {
  69.     if (S == NULL)
  70.     {
  71.         Error("Must use CreateLiStack first!");
  72.     }
  73.     else
  74.     {
  75.         while (!IsLiStackEmpty(S))
  76.         {
  77.             PopLiStack(S);
  78.         }
  79.     }
  80. }
  82. void DisposeLiStack(LiStack S)
  83. {
  84.     MakeLiStackEmpty(S);
  85.     free(S);
  86. }
  88. void PushLiStack(ElementType X, LiStack S)
  89. {
  90.     PtrToNode TmpCell;
  91.     TmpCell = malloc(sizeof(struct LiStackNode));
  92.     if (TmpCell == NULL)
  93.     {
  94.         FatalError("Out of memory!!");
  95.     }
  96.     else
  97.     {
  98.         TmpCell->Element = X;
  99.         TmpCell->Next = S->Next;
  100.         S->Next = TmpCell;
  101.     }
  102. }
  104. ElementType TopOfLiStack(LiStack S)
  105. {
  106.     if (!IsLiStackEmpty(S))
  107.     {
  108.         return S->Next->Element;
  109.     }
  110.     Error("Empty stack!");
  111.     return 0; /* Return value used to avoid warning */
  112. }
  114. void PopLiStack(LiStack S)
  115. {
  116.     PtrToNode FirstCell;
  117.     if (IsLiStackEmpty(S))
  118.     {
  119.         Error("Empty stack!");
  120.     }
  121.     else
  122.     {
  123.         FirstCell = S->Next;
  124.         S->Next = S->Next->Next;
  125.         free(FirstCell);
  126.     }
  127. }
  129. /*
  130.  * LiStackTest.c - by FreeMan
  131.  */
  133. #include "LiStack.h"
  134. #include <stdio.h>
  136. main()
  137. {
  138.     LiStack S;
  139.     int i;
  141.     S = CreateLiStack();
  142.     for (i = 0; i < 10; i++)
  143.     {
  144.         PushLiStack(i, S);
  145.     }
  147.     while (!IsLiStackEmpty(S))
  148.     {
  149.         printf("%d\n", TopOfLiStack(S));
  150.         PopLiStack(S);
  151.     }
  153.     DisposeLiStack(S);
  154.     return 0;
  155. }
  157. // Output:
  158. /*
  159. 9
  160. 8
  161. 7
  162. 6
  163. 5
  164. 4
  165. 3
  166. 2
  167. 1
  168. 0
  170. */

发表评论

表情：
评论列表 （有 0 条评论，275人围观）

还没有评论，来说两句吧...

相关阅读