/**
* 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 == NULL || head->next == NULL)
return true;
ListNode *slow = head, *fast = head;
while(fast->next != NULL && fast->next->next != NULL){
slow = slow->next;
fast = fast->next->next;
}
slow->next = reverseList(slow->next);
slow = slow->next;
while(slow != NULL){
if(head->val != slow->val)
return false;
leetcode题解
最新推荐文章于 2021-12-07 15:41:18 发布
本文详细解析了LeetCode上的热门算法题目,通过实例探讨了各种解题思路,包括但不限于二分查找、动态规划、回溯法等,旨在提升编程思维和问题解决能力。
摘要由CSDN通过智能技术生成