[2023 King's Road Data Structure] [Stack, Queue and Array-page70-04] Complete implementation of C and C++ (can be run directly)

~~~How can the writing style end in a dull way, and the story does not recognize ordinary at the beginning ✌✌✌

If you need the complete code, you can follow the public account below, and reply "code" in the background to get it. Aguang is looking forward to your visit~

Question:

Let the header pointer of a singly linked list be L, and the node structure consists of two fields, data and next. The data field is a character type. Try to design an algorithm to judge whether all n characters of the linked list are centrosymmetric.

Problem solving ideas:

>将链表前半元素压进栈中
>然后依次出栈、遍历链表后半部分元素进行比较

Code:

#include <iostream>
using namespace std;

// 单链表定义
typedef struct LNode
{
    char data;
    struct LNode *next;
} LNode, *LinkList;

// 链表尾插法插入元素
void TailInsert(LinkList &L)
{
    char val = '0';
    LNode *r = L;
    while (cin >> val)
    {
        LNode *s = new LNode;
        s->data = val;
        r->next = s;
        r = s;
        r->next = NULL;

        if (cin.get() == '\n')
        {
            break;
        }
    }
}

// 遍历输出链表元素
void Print(LinkList L)
{
    LNode *p = L->next;
    while (p)
    {
        cout << p->data << '\t';
        p = p->next;
    }
    cout << endl;
}

void fn(LinkList L, int n)
{
    char *s = new char[n / 2];
    LNode *p = L->next;
    for (int i = 0; i < n / 2; i++)
    {
        s[i] = p->data;
        p = p->next;
    }
    if (n % 2 == 1)
    {
        p = p->next;
    }
    int k = n / 2 - 1;
    while (p && s[k] == p->data)
    {
        k--;
        p = p->next;
    }
    if (k == -1)
    {
        cout << "链表元素中心对称";
        return;
    }
    else
    {
        cout << "链表元素不中心对称";
    }
}

int main()
{
    LinkList L = new LNode;
    L->next = NULL;
    TailInsert(L);
    Print(L);
    fn(L, 4);
}