Palindrome Linked List

Title Description:

if  is   do in O (n) Time and O (1) space?

The idea is to reverse the first or second half of a single-linked list, and then compare it.

Solution:

BOOLIspalindrome (listnode*head) {    if(head = = NULL | | head->next = =NULL)return true; ListNode*fast =Head; ListNode*slow =Head;  while(Fast->next! =NULL) {Fast= fast->Next; Slow= slow->Next; if(Fast->next! =NULL) Fast= fast->Next; } Fast=reverselist (slow); ListNode*p =Head;  while(P! = Slow && P->val = = fast->val) {P= p->Next; Fast= fast->Next; }    if(p = =slow)return true; Else        return false;}

Reverse the single-linked list code see here

Palindrome Linked List