栈 II

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

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

  3. void create_stack(unsigned int size);

  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. static STACK_TYPE *stack;
  6. static size_t stack_size;
  7. static int top_element = -1;

  9. void
  10. create_stack(size_t size)
  11. {
  12.         assert(stack_size == 0);
  13.         stack_size = size;
  14.         stack = malloc(stack_size * sizeof(STACK_TYPE));
  15.         assert(stack != NULL);
  16. }

  18. void
  19. push(STACK_TYPE value)
  20. {
  21.         assert(is_full != 0);
  22.         top_element++;
  23.         stack[top_element] = value;
  24. }

  26. void
  27. pop(void)
  28. {
  29.         assert(is_empty != 0);
  30.         top_element--;
  31. }

  33. STACK_TYPE
  34. top(void)
  35. {
  36.         assert(is_empty != 0);
  37.         return (stack[top_element]);
  38. }

  40. int
  41. is_empty(void)
  42. {
  43.         if (-1 == top_element)
  44.                 return 0;
  45.         else
  46.                 return -1;
  47. }

  49. int
  50. is_full(void)
  51. {
  52.         if (stack_size - 1 == top_element)
  53.                 return 0;
  54.         else
  55.                 return -1;
  56. }


  59. void
  60. destory_stack(void)
  61. {
  62.         assert(stack_size > 0);
  63.         stack_size = 0;
  64.         free(stack);
  65.         stack = NULL;
  66. }

/*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(len);

  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: 0

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






上一篇：栈 I
下一篇：栈 III

文章评论