堆栈的各种算法

绝地灬酷狼 2022-04-23 10:58 119阅读 0赞

**注：此文章来自“CSDN”博主，仅在此借鉴，学习**

**各种基本算法实现小结（二）—— 堆 栈**

**（均已测试通过）**

==============================================================

**栈——数组实现**

**测试环境：Win - TC**

**\[cpp\]** [view plain][] [copy][view plain] [print][view plain] [?][view plain]

1.  \#include <stdio.h>
2.  char stack\[512\];
3.  int top=0;
4.  void push(char c)
5.  \{
6.  stack\[top\]=c;
7.  top++;
8.  \}
9.  char pop()
10. \{
11. top--;
12. return stack\[top\];
13. \}
14. int is\_empty()
15. \{
16. return 0==top;
17. \}
18. void main()
19. \{
20. push('1');
21. push('2');
22. push('3');
23. push('4');
24. push('5');
25. while(!is\_empty())
26. putchar(pop());
27. putchar('/n');
28. getch();
29. \}

**运行结果：**

![0_1275572837S4dk.gif][]

====================================================

**栈——数组实现2**

**测试环境：Win - TC**

**\[cpp\]** [view plain][] [copy][view plain] [print][view plain] [?][view plain]

1.  \#include <stdio.h>
2.  \#include <malloc.h>
3.  /\* typedef int DataType; \*/
4.  \#define DataType int
5.  \#define MAX 1024
6.  typedef struct
7.  \{
8.  DataType data\[MAX\];
9.  int top;
10. \}stack, \*pstack;
11. pstack \*init\_stack()
12. \{
13. pstack ps;
14. ps=(pstack)malloc(sizeof(stack));
15. if(!ps)
16. \{
17. printf("Error. fail malloc.../n");
18. return NULL;
19. \}
20. ps->top=-1;
21. return ps;
22. \}
23. int empty\_stack(pstack ps)
24. \{
25. if(-1 == ps->top)
26. return 1;
27. else
28. return 0;
29. \}
30. int push(pstack ps, DataType data)
31. \{
32. if(ps->top == MAX-1)
33. \{
34. printf("Stack is full.../n");
35. return 0;
36. \}
37. ps->top++;
38. ps->data\[ps->top\]=data;
39. return 1;
40. \}
41. int pop(pstack ps, DataType \*data)
42. \{
43. if(empty\_stack(ps))
44. \{
45. printf("Stack is empty.../n");
46. return 0;
47. \}
48. \*data=ps->data\[ps->top\];
49. ps->top--;
50. return 1;
51. \}
52. DataType top\_stack(pstack ps)
53. \{
54. if(empty\_stack(ps))
55. \{
56. printf("Stack is empty.../n");
57. return 0;
58. \}
59. return ps->data\[ps->top\];
60. \}
61. void display(pstack ps)
62. \{
63. int i;
64. if(empty\_stack(ps))
65. \{
66. printf("Stack is empty.../n");
67. return;
68. \}
69. printf("printf the items of stack.../n");
70. for(i=ps->top;i>-1;i--)
71. printf("%4d", ps->data\[i\]);
72. printf("/n/n");
73. \}
74. void main()
75. \{
76. int i, num, data, \*pdata;
77. pstack ps;
78. ps=init\_stack();
79. printf("Enter stack num:");
80. scanf("%d", &num);
81. for(i=0;i<num;i++)
82. \{
83. scanf("%d", &data);
84. push(ps, data);
85. \}
86. display(ps);
87. printf("Top is %d/n/n", top\_stack(ps));
88. for(i=0;i<num;i++)
89. \{
90. pop(ps, pdata);
91. printf("%3d", \*pdata);
92. \}
93. printf("/n/n");
94. display(ps);
95. getch();
96. \}

**运行结果：**

![0_1275578805qQZQ.gif][]

====================================================

**栈——链表实现**

**测试环境：Win - TC**

**\[cpp\]** [view plain][] [copy][view plain] [print][view plain] [?][view plain]

1.  \#include <stdio.h>
2.  \#include <malloc.h>
3.  typedef char DataType;
4.  struct \_node
5.  \{
6.  DataType data;
7.  struct \_node \*next;
8.  \};
9.  typedef struct \_node node, \*pstack;
10. pstack init\_stack()
11. \{
12. pstack ps;
13. ps=(pstack)malloc(sizeof(node));
14. if(NULL == ps)
15. \{
16. printf("Error. malloc is fail.../n"); 再分享一下我老师大神的人工智能教程吧。零基础！通俗易懂！风趣幽默！还带黄段子！希望你也加入到我们人工智能的队伍中来！[https://blog.csdn.net/jiangjunshow][https_blog.csdn.net_jiangjunshow]

[view plain]: http://blog.csdn.net/sunboy_2050/article/details/5645812#
[0_1275572837S4dk.gif]: /images/20220320/3f12c1ca1080451eb09a22aa03a8d666.png
[0_1275578805qQZQ.gif]: /images/20220320/99c2fa8ed62647c595a111b39278bc1c.png
[https_blog.csdn.net_jiangjunshow]: https://blog.csdn.net/jiangjunshow/article/details/77338485