[palindrome structure of or36 linked list]

---

One 、 Title Description

Topic link

---

Two 、 Provide easy to read code diagram

---

3、 ... and 、 Title code

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) {} };*/
struct ListNode *findMid(struct ListNode*head)
{
    
    struct ListNode* fast=head;
    struct ListNode* slow=head;
    while(fast&&fast->next)
    {
    
        slow=slow->next;
        fast=fast->next->next;
    }
    return slow;
}
struct ListNode * reserve(struct ListNode*head)
{
    
    struct ListNode*newHead=NULL;
    struct ListNode*cur=head;
    while(cur)
    {
    
        struct ListNode*next=cur->next;
        cur->next=newHead;
        newHead=cur;
        cur=next;
    }
    return newHead;
}
class PalindromeList {
    
public:
    bool chkPalindrome(ListNode* A) {
    
        ListNode* mid=findMid(A);
        ListNode*head=reserve(mid);
        ListNode*rhead=head;
        ListNode*Ahead=A;
        while(rhead&&Ahead)
        {
    
            if(rhead->val!=Ahead->val)
            {
    
                return false;
            }
            else
            {
    
                rhead=rhead->next;
                Ahead=Ahead->next;
            }
        }
        return true;
    }
};

---

The above is the whole content of this article , If there are mistakes in the article or something you don't understand , Communicate more with meow bloggers . Learn from each other and make progress . If this article helps you , Can give meow bloggers a concern , Your support is my biggest motivation .