leetcode_9_链表的回文结构

/*
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* slow, *fast;
        slow = fast = head;
        while (fast && fast->next)
        {
            slow = slow->next;
            fast = fast->next->next;
        }
        return slow;
    }
    struct ListNode* reverseList(struct ListNode* head)
    {
        struct ListNode* cur = head, * newhead = NULL;
        while (cur)
        {
            struct ListNode* next = cur->next;

            //头插
            cur->next = newhead;
            newhead = cur;

            cur = next;
        }

        return newhead;
    }
    bool chkPalindrome(ListNode* head) {
        struct ListNode* mid = middleNode(head);
        struct ListNode* rhead = reverseList(mid);

        while(head && rhead)
        {
            if(head->val != rhead->val)
            {
                return false;
            }
            head = head->next;
            rhead = rhead->next;            
        }

        return true;
    }
};