题解 | #链表的回文结构#

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};*/
class PalindromeList {
public:
struct ListNode* middleNode(struct ListNode* head) {
    struct ListNode* fast=head;
    struct ListNode* slow=head;
    while(fast&&fast->next)
    {
        fast=fast->next->next;
        slow=slow->next;
    }
    return slow;
    }
    struct ListNode* reverseList(struct ListNode* head) {
    struct ListNode* cur = head;
    struct ListNode* newhead = NULL;
    while (cur) {
        struct ListNode* temp=cur->next;
        cur->next=newhead;
        newhead=cur;
        cur=temp;
    }
    return newhead;
    }
    bool chkPalindrome(ListNode* A) {
        ListNode* cur=A;
        ListNode* mid=middleNode(cur);
        ListNode* p=reverseList(mid);
        while(p)
        {
            if(p->val!=A->val)
            return false;
            p=p->next;
            A=A->next;
        }
        return true;
    }
};