栈 III

1397阅读　1评论2011-05-01　onezeroone
分类：C/C++

/*stack.h*/
  1. #define STACK_TYPE int

  3. void create_stack(void);

  5. void push(STACK_TYPE value);

  7. void pop(void);

  9. STACK_TYPE top(void);

  11. int is_empty(void);

  13. int is_full(void);

  15. void destory_stack(void);

/*stack.c*/
  1. #include "stack.h"
  2. #include <assert.h>
  3. #include <stdlib.h>

  5. #define TRUE 0
  6. #define FALSE -1

  8. struct _node {
  9.         STACK_TYPE value;
  10.         struct _node *next;
  11. };
  12. typedef struct _node stackNode;

  14. static stackNode *stack;

  16. void
  17. create_stack(void)
  18. {
  19.         stack = NULL;
  20. }

  22. void
  23. push(STACK_TYPE value)
  24. {
  25.         stackNode *new_node;
  26.         new_node = malloc(sizeof(stackNode));
  27.         assert(NULL != new_node);
  28.         new_node->value = value;
  29.         new_node->next = stack;
  30.         stack = new_node;
  31. }

  33. void
  34. pop(void)
  35. {
  36.         assert(is_empty() != TRUE);
  37.         stackNode *tmpNode;
  38.         tmpNode = stack;
  39.         stack = stack->next;
  40.         free(tmpNode);
  41. }

  43. STACK_TYPE
  44. top(void)
  45. {
  46.         assert(is_empty() != TRUE);
  47.         return (stack->value);
  48. }

  50. int
  51. is_empty(void)
  52. {
  53.         if (stack == NULL)
  54.                 return TRUE;
  55.         else
  56.                 return FALSE;
  57. }


  60. int
  61. is_full(void)
  62. {
  63.         return FALSE;
  64. }

  66. void
  67. destory_stack(void)
  68. {
  69.         while (is_empty() != TRUE)
  70.                 pop();
  71. }

/*test.c*/
  1. #include <stdio.h>
  2. #include "stack.h"

  4. int
  5. main(void)
  6. {
  7.         int a[10] = {1,3,5,7,9,0,2,4,6,8};
  8.         int len = sizeof(a)/sizeof(a[0]);
  9.         int i;

  11.         create_stack();

  13.         printf("stack is_empty: %d\n", is_empty());
  14.         printf("stack is_full: %d\n", is_full());
  15.         printf("\n");

  17.         for (i = 0; i < len; i++) {
  18.                 push(a[i]);
  19.                 printf("%d,", top());
  20.         }
  21.         printf("\n");

  23.         printf("stack is_empty: %d\n", is_empty());
  24.         printf("stack is_full: %d\n", is_full());
  25.         printf("\n");

  27.         for (i = 0; i < len; i++) {
  28.                 printf("%d,", top());
  29.                 pop();
  30.         }
  31.         printf("\n");

  33.         printf("stack is_empty: %d\n", is_empty());
  34.         printf("stack is_full: %d\n", is_full());
  35.         printf("\n");

  37.         destory_stack();

  39.         return 0;
  40. }

/*output*/
  1. stack is_empty: 0
  2. stack is_full: -1

  4. 1,3,5,7,9,0,2,4,6,8,
  5. stack is_empty: -1
  6. stack is_full: -1

  8. 8,6,4,2,0,9,7,5,3,1,
  9. stack is_empty: 0
  10. stack is_full: -1


上一篇：栈 II
下一篇：return 局部变量

文章评论