Leetcode 234. Palindrome Linked List | | Leetcode 234. Palindrome Linked List 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution1234567891011121314151617181920212223242526272829303132333435363738394041/** * 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) { if(!head || !head->next) { return true; } ListNode* current = head; ListNode* mid = head; while(current && current->next) { mid = mid->next; current = current->next->next; } ListNode* pre = mid; current = mid->next; mid->next = nullptr; ListNode* next = nullptr; while(current) { next = current->next; current->next = pre; pre = current; current = next; } current = head; while(pre) { if(pre->val != current->val) { return false; } pre = pre->next; current = current->next; } return true; }}; Reference https://leetcode.com/problems/palindrome-linked-list/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏