【leetcode234】回文链表

题目

https://leetcode-cn.com/problems/palindrome-linked-list/

解决方案

bool isPalindrome(ListNode* head) {

        //时间复杂度O（n）空间复杂度O（1）
        //快慢指针找链表中点
        //0，1返回正确
        if( !head || !head->next )
            return true;
        
        ListNode* fast = head, * slow = head;
        while(fast && fast->next)
        {
            slow = slow->next;
            fast = fast->next->next;
        }
        
        //slow指针为链表中点
        //反转后半部分链表
        ListNode* curr = slow, *back = NULL, *after = NULL;
        while(curr)
        {
            after = curr->next;
            curr->next = back;
            back = curr;
            curr = after;
        }
        
        //前一半链表和后一半链表相对比
        ListNode* front = head, *out = back;
        while(front && out)
        {
            if(front->val != out->val)
                return false;
            front = front->next;
            out = out->next;
        }
        
        return true;
        
    }

复杂度分析

时间复杂度$O(n)$，只需要有限次的循环
空间复杂度$O(1)$，在原址上操作