234. Palindrome Linked List

问题描述

Given a singly linked list, determine if it is a palindrome.

Follow up:
Could you do it in O(n) time and O(1) space?

题目链接：

---

思路分析

判断一个链表是否是回文的。链表的特性注定了这是一个查找难，增删容易的数据结构。用一个向量保存链表的内容，然后进行判断。只需要循环一半就可以。

代码

递归

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool isPalindrome(ListNode* head) {
        vector<int> vec;
        while (head){
            vec.push_back(head->val);
            head = head->next;
        }
        int n = vec.size();
        for (int i = 0; i < n - 1 - i; i++){
            if (vec[i] != vec[n - 1 - i])
                return false;
        }
        return true;
    }
};

时间复杂度：$O(n)$
空间复杂度：$O(n)$

---

反思

关于follow up，如何用$O(1)$的空间复杂度完成判断。讨论区给出的方法是，找到一半部分，翻转它，然后比较……

class Solution {
public:

inline void reverse(ListNode* head) {
    ListNode *node1, *node2, *node3;
    node1 = head;
    node2 = node1->next;
    node1->next = NULL;
    while(node2)
    {
        node3 = node2->next;
        node2->next = node1;
        node1 = node2;
        node2 = node3;
    }
}

bool isPalindrome(ListNode* head) {

// lengths 0, 1 are palindrome
if(!head || !head->next)
{
    return true;
}

// length 2 goes simple judging
if(!head->next->next)
{
    return head->val == head->next->val;
}

// step 1: find middle and tail nodes
ListNode *middle, *rbegin;
middle = rbegin = head;
while(rbegin->next)
{
    if(rbegin->next->next)
    {
        middle = middle->next;
        rbegin = rbegin->next->next;
    }
    else
    {
        rbegin = rbegin->next;
    }
}

// step 2: reverse the latter half
reverse(middle->next);

// step 3: check for palindrome
bool result = true;
ListNode* node1 = head;
ListNode* node2 = rbegin;
while(node2)
{
    if(node1->val != node2->val)
    {
        result = false;
        break;
    }

    node1 = node1->next;
    node2 = node2->next;
}

// step 4: restore the reversed latter half
reverse(rbegin);

return result;
}
};