栈 I

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

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

  3. void push(STACK_TYPE value);

  5. void pop(void);

  7. STACK_TYPE top(void);

  9. int is_empty(void);

  11. int is_full(void);

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

  4. #define STACK_SIZE 100

  6. static STACK_TYPE stack[STACK_SIZE];
  7. static int top_element = -1;


  10. void
  11. push(STACK_TYPE value)
  12. {
  13.         assert(is_full != 0);
  14.         top_element++;
  15.         stack[top_element] = value;
  16. }

  18. void
  19. pop(void)
  20. {
  21.         assert(is_empty != 0);
  22.         top_element--;
  23. }

  25. STACK_TYPE
  26. top(void)
  27. {
  28.         assert(is_empty != 0);
  29.         return (stack[top_element]);
  30. }

  32. int
  33. is_empty(void)
  34. {
  35.         if (-1 == top_element)
  36.                 return 0;
  37.         else
  38.                 return -1;
  39. }

  41. int
  42. is_full(void)
  43. {
  44.         if (STACK_SIZE - 1 == top_element)
  45.                 return 0;
  46.         else
  47.                 return -1;
  48. }
/*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.         printf("stack is_empty: %d\n", is_empty());
  12.         printf("stack is_full: %d\n", is_full());
  13.         printf("\n");

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

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

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

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

  35.         return 0;
  36. }

/*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

上一篇：winDbg 起步
下一篇：栈 II

文章评论