Linux下的C语言编程——栈操作

分手后的思念是犯贱 2022-07-15 09:12 226阅读 0赞

栈的基本

#include <stdio.h>
    #include <stdlib.h>
    
    #define MAX 10
    
    enum return_result{FULL_OK,FULL_NO,EMPTY_OK,EMPTY_NO,PUSH_OK};
    
    struct queue_data
    {
    	int queue[MAX];
    	int top;
    	int buttom;
    };
    
    typedef struct queue_data Queue;
    
    void creat_queue(Queue **queue)
    {
    	*queue = (Queue*)malloc(sizeof(struct queue_data));
    }
    
    void init_queue(Queue ** queue)
    {
    	(*queue)->top = -1;
    	(*queue)->buttom = -1;
    }
    
    int is_full(Queue **queue)
    {
    	if((*queue)->buttom == -1)
    	{
    		if((*queue)->top == MAX - 1)
    		{
    			return FULL_OK;
    		}
    	}
    	else if((((*queue)->top - (*queue)->buttom) + 1) == MAX)
    	{
    		return FULL_OK;
    	}
    
    	return FULL_NO;
    }
    
    int is_empty(Queue ** queue)
    {
    	if((*queue)->top <= (*queue)->buttom)
    	{
    		return EMPTY_OK;
    	}
    
    	return EMPTY_NO;
    }
    
    int push_queue(Queue ** queue,int num)
    {
    	int i;
    	
    	if(is_full(queue) == FULL_OK)
    	{
    		printf("the queue is full!\n");
    		exit(FULL_OK);
    	}
    
    	if((*queue)->top < MAX - 1)
    	{
    		((*queue)->top)++;
    		((*queue)->queue[(*queue)->top]) = num;
    	}
    	else
    	{
    		for(i = (*queue)->buttom; i <= (*queue)->top; i++)
    		{
    			(*queue)->queue[i - (*queue)->buttom] = (*queue)->queue[i];
    
    		}
    		(*queue)->top = (*queue)->top - (*queue)->buttom - 1;
    		(*queue)->buttom = 0;
    		((*queue)->top)++;
    		((*queue)->queue[(*queue)->top]) = num;
    	}
    
    	return PUSH_OK;
    }
    
    int pop_queue(Queue ** queue)
    {
    	if(is_empty(queue) == EMPTY_OK)
    	{
    		printf("the queue is empty!\n");
    		exit(EMPTY_OK);
    	}
    	
    	return ((*queue)->queue[++((*queue)->buttom)]);
    }
    
    int main()
    {
    	Queue *queue;
    	
    	creat_queue(&queue);
    	init_queue(&queue);
    
    	int i;
    
    	for(i = 0; i < MAX; i++)
    	{
    		if(push_queue(&queue,i+1) == PUSH_OK)
    		{
    			printf("push num\t %d\n",i + 1);
    		}
    	}
    
    	for(i = 0; i < MAX; i++)
    	{
    		printf("pop num:\t %d\n",pop_queue(&queue));
    	}
    
        return 0;
    }

操作