LeetCode入门训练回文链表

最新推荐文章于 2023-05-09 14:59:09 发布

qq_38620941

最新推荐文章于 2023-05-09 14:59:09 发布

阅读量64

点赞数

分类专栏： LeetCode 文章标签：链表

本文链接：https://blog.csdn.net/qq_38620941/article/details/107561232

版权

LeetCode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

一种是直接将元素压入栈然后依次退栈和链表相比

第二种是快慢指针，fast两格一跳，slow 一格一跳。在后半压入栈。与链表相比

第三种直接在后半段取反比较完后还原

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        struct ListNode *p = NULL;
        struct ListNode *q;
        while (head) {
            q = head;
            head = head->next;
            q->next = p;
            p = q;
        }
        return p;
    }
    bool isPalindrome(ListNode* head) {
        
        if (head == NULL) return true;
        if (head->next == NULL) return true;
        if (head->next->next == NULL) {
            if (head->val == head->next->val) 
                return true;
            else return false;
        }
        ListNode *fast = head;
        ListNode *slow = head;
        while (fast->next != NULL && fast->next->next != NULL) {
            slow = slow->next;
            fast = fast->next->next;
        }
        if (fast->next !=NULL) {
            fast = fast->next;
        }
        ListNode *newhead = slow->next;
        slow->next = NULL;
        newhead = reverseList(newhead);
        ListNode *p = head;
        ListNode *q = newhead;
        while (p != NULL && q != NULL) {
            if (p->val != q->val)
                return false;
            p = p->next;
            q = q->next;
        }
        return true;
    }
};