LeetCode-234. Palindrome Linked List

LeetCode-234. Palindrome Linked List

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

Example 1:

Input: 1->2Output: false

Example 2:

Input: 1->2->2->1Output: true

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

题解：

比较主流的解法是找到链表中点，然后翻转后半部分，再判断前半部分和后半部分是否一致。

class Solution {public: bool isPalindrome(ListNode* head) { string s, rs; ListNode *pre = NULL, *rehead = head; while (head != NULL) { rehead = head; s += to_string(head->val); head = head->next; rehead->next = pre; pre = rehead; } while (rehead != NULL) { rs += to_string(rehead->val); rehead = rehead->next; } return rs == s; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。