数字的回文判断，通过栈和队列的方法(C语言实现)

曾经终败给现在 2023-02-13 14:44 9阅读 0赞

//头文件和结构体

//初始化顺序栈

SqStack *init_SequenStack()
    { 
        SqStack *S;
        S = (SqStack *)malloc(sizeof(SqStack));
        if(0 == S){ 
            return S;
        }
        S -> top = -1;
        return S;
    }

//初始化化队列

LQueue *init_LinkQueue()
    { 
        LQueue *L;
        LinkQueue *head;
        L = (LQueue *)malloc(sizeof(LQueue));
        head = (LinkQueue *)malloc(sizeof(LinkQueue));
        if(0 == L || 0 == head){ 
            return 0;
        }
        L -> front = head;
        L -> rear = head;
        head -> next = NULL;
        return L;
    }

//压栈

void push_Stack(SqStack *S,elemtype x)
    { 
        if(MAXSIZE - 1 == S -> top){ 
            printf("栈满了!\n");
            return;
        }
        S -> top ++;
        S -> data[S -> top] = x;
    }

//进队列

void enter_Queue(LQueue *L,elemtype x)
    { 
        LinkQueue *q;
        q = (LinkQueue *)malloc(sizeof(LinkQueue));
        if(0 == q){ 
            printf("空间不足,操作失败!\n");
            return;
        }
        q -> data = x;
        L -> rear -> next = q;
        L -> rear = q;
        q -> next = NULL;
    }

//出栈

elemtype pop_Stack(SqStack *S,elemtype x)
    { 
        if(-1 == S -> top){ 
            printf("该栈是空的,操作失败!\n");
        }
        x = S -> data[S -> top];
        S -> top --;
        return x;
    }

//出队列

elemtype delete_QueueNode(LQueue *L,elemtype x)
    { 
        if(L -> front == L -> rear){ 
            printf("该队列里没有元素了!\n");
            return -1;
        }
        LinkQueue *node;//首节点
        node = L -> front -> next;
        x = node -> data;
        L -> front -> next = node -> next;
        if(L -> rear == node){ 
            L -> front = L -> rear;
        }
        free(node);
        return x;
    }

//下面的完整代码

#include <stdio.h>
    #include <stdlib.h>
    #define MAXSIZE 1024
    
    typedef int elemtype;
    //栈结构体
    typedef struct SequenStack
    { 
        elemtype data[MAXSIZE];
        int top;
    }SqStack;
    //队列结构体
    typedef struct LinkQueuenode
    { 
        elemtype data;
        struct LinkQueuenode *next;
    }LinkQueue;
    typedef struct LQueue
    { 
        struct LinkQueuenode *front;
        struct LinkQueuenode *rear;
    }LQueue;
    
    //初始化顺序栈
    SqStack *init_SequenStack()
    { 
        SqStack *S;
        S = (SqStack *)malloc(sizeof(SqStack));
        if(0 == S){ 
            return S;
        }
        S -> top = -1;
        return S;
    }
    
    //初始化化队列
    LQueue *init_LinkQueue()
    { 
        LQueue *L;
        LinkQueue *head;
        L = (LQueue *)malloc(sizeof(LQueue));
        head = (LinkQueue *)malloc(sizeof(LinkQueue));
        if(0 == L || 0 == head){ 
            return 0;
        }
        L -> front = head;
        L -> rear = head;
        head -> next = NULL;
        return L;
    }
    
    void push_Stack(SqStack *S,elemtype x)
    { 
        if(MAXSIZE - 1 == S -> top){ 
            printf("栈满了!\n");
            return;
        }
        S -> top ++;
        S -> data[S -> top] = x;
    }
    
    void enter_Queue(LQueue *L,elemtype x)
    { 
        LinkQueue *q;
        q = (LinkQueue *)malloc(sizeof(LinkQueue));
        if(0 == q){ 
            printf("空间不足,操作失败!\n");
            return;
        }
        q -> data = x;
        L -> rear -> next = q;
        L -> rear = q;
        q -> next = NULL;
    }
    
    elemtype pop_Stack(SqStack *S,elemtype x)
    { 
        if(-1 == S -> top){ 
            printf("该栈是空的,操作失败!\n");
        }
        x = S -> data[S -> top];
        S -> top --;
        return x;
    }
    
    elemtype delete_QueueNode(LQueue *L,elemtype x)
    { 
        if(L -> front == L -> rear){ 
            printf("该队列里没有元素了!\n");
            return -1;
        }
        LinkQueue *node;//首节点
        node = L -> front -> next;
        x = node -> data;
        L -> front -> next = node -> next;
        if(L -> rear == node){ 
            L -> front = L -> rear;
        }
        free(node);
        return x;
    }
    
    int main()
    { 
        elemtype x;
        LQueue *L;//指向队列的指针
        SqStack *S;//指向栈的指针
        L = init_LinkQueue();
        S = init_SequenStack();
        int i,ix,num;
        printf("请输入您想输入回文的个数:");
        scanf("%d",&num);
        elemtype arr1[num];//存放出栈数据的数组
        elemtype arr2[num];//存放进栈数据的数组
        printf("请输入您想判断数字类型的回文(输入-1结束):");
        while(1){ 
            scanf("%d",&ix);
            if(-1 == ix){ 
                break;
            }
            push_Stack(S,ix);//进栈
            enter_Queue(L,ix);//进队列
        }
        for(i = 0;i < num;i ++){ 
            if(-1 == S -> top || L -> front == L -> rear){ //这句话可有可无，有的话减少意外
                break;
            }
            arr1[i] = pop_Stack(S,x);
            arr2[i] = delete_QueueNode(L,x);
            if(arr1[i] != arr2[i]){ 
                printf("不是回文!\n");
                return;
            }
        }
        printf("该串数据是回文!");
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NjYyNjgzMw_size_16_color_FFFFFF_t_70]

目前水平有限，还不能做的很好，后面技术上一个台阶后，会来修改的。  
小伙伴觉得对您有帮助，点个赞吧。

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NjYyNjgzMw_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/20200529165132635.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NjYyNjgzMw==,size_16,color_FFFFFF,t_70