【剑指offer】OR36 链表的回文结构

描述

对于一个链表，请设计一个时间复杂度为O(n),额外空间复杂度为O(1)的算法，判断其是否为回文结构。

给定一个链表的头指针A，请返回一个bool值，代表其是否为回文结构。保证链表长度小于等于900。

 测试案例：

1->2->2->1

返回：true

 方法：

1.首先找到中间位置

2.逆置右半边

3.个个对比

 

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};*/
struct ListNode* reverseList(struct ListNode* head)
{
	struct ListNode* newHead = NULL;
	struct ListNode* cur = head;
	while (cur)
	{
		struct ListNode* next = cur->next;
		cur->next = newHead;
		newHead = cur;
		cur = next;

	}
	return newHead;
}

struct ListNode* middleNode(struct ListNode* head)
{
	struct ListNode* slow = head;
	struct ListNode* fast = head;
	while (fast && fast->next)
	{
		fast = fast->next->next;
		slow = slow->next;
	}
	return slow;
}


class PalindromeList {
public:
    bool chkPalindrome(ListNode* A) {
        // write code here
        struct ListNode* mid = middleNode(A); 
	struct ListNode* rHead = reverseList(mid);

	struct ListNode* curA = A;
	struct ListNode* curR = rHead;

	while (curA && curR)
	{
		if (curA->val == curR->val)
		{
			curA = curA->next;
			curR = curR->next;
		}
		else
		{
			return false;
		}
	}
	return true;
    }
};