/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) {} };*/ //找中间节点,反转后续链表,比较 #include <csetjmp> class PalindromeList { public: struct ListNode* reverseList(struct ListNode* head) { struct ListNode* newnode = NULL, *ptr = head, *nextnode, *ptr1; while (ptr...