INDEX
1.¸ñÀû
2.¼Ò½ºÄÚµå
3.ÀÌ¿ëÇÑ ÇÔ¼ö
4.Ãâ·Â°á°ú
5.Á¤¸®
1.¸ñÀû
Á¤¼ö°ªÀ» ÀÔ·ÂÇÑ Á¤¼öÀÇ °³¼ö´ë·Î ÀÓÀÇ·Î ¹Þ¾Æ Å¥¿¡ enqueue,dequeue ÇÏ¿© Ãâ·Â°ªÀ» txt ÆÄÀÏ¿¡ Ãâ·ÂÇÑ´Ù. ´Ù½Ã °°Àº °ªÀ» ½ºÅÿ¡ push ÇÑ ÈÄ, ´Ù½Ã pop ÇÏ¿© ±× °ªµéÀÌ ¿ª¼øÀ¸·Î txt ÆÄÀÏ·Î Ãâ·ÂµÇµµ·Ï ÇÑ´Ù.
2.¼Ò½ºÄÚµå
Çì´õÆÄÀÏ1 //ArrayBaseStack.h
#ifndef AB_STACK_H
#define AB_STACK_H
#define TRUE 1
#define FALSE 0
#define STACK_LEN 100
typedef int Data;
typedef struct _arrayStack
{
Data stackArr[STACK_LEN];
int topIndex;
}ArrayStack;
typedef ArrayStack Stack;
void StackInit(Stack pstack);
int SIsEmpty(Stack pstack);
void SPush(Stack pstack,Data data);
Data SPop(Stack pstack);
Data SPeek(Stack pstack);
#endif
Çì´õÆÄÀÏ2//CircularQueue.h
#ifndef c_QUEUE_H
#define c_QUEUE_H
#define TRUE 1
#define FAL¡¦(»ý·«)
|