Q:Check if a list is a palindrome
A: 将链表的后半部分反转,然后和前半部分分别比较
#include <iostream>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
ListNode *init(int a[], int n) {
ListNode *head = NULL;
ListNode *p = NULL;
for (int i = 0; i < n; i++) {
ListNode *cur = new ListNode(a[i]);
if (i == 0) {
head = cur;
p = cur;
}
p->next = cur;
p = cur;
}
return head;
}
void reverse(ListNode *prev ,ListNode *begin) {
ListNode *p = begin, *cur = begin->next, *next = cur->next;
for (; cur; p = cur, cur = next, next = next?next->next:NULL) {
cur->next = p;
}
prev->next = p;
begin->next = NULL;
return ;
}
bool isPalindrome(ListNode *head) {
if (!head || !head->next) {
return true;
}
ListNode *prev = head;
ListNode *slow = head;
ListNode *fast = head;
while (fast && fast->next) {
prev = slow;
slow = slow->next;
fast = fast->next->next;
}
if (fast) {
prev = slow;
}
reverse(prev, prev->next);
slow = head;
prev = prev->next;
while (prev) {
if (slow->val != prev->val) {
return false;
}
slow = slow->next;
prev = prev->next;
}
return true;
}
void printList(ListNode *head) {
ListNode *p = head;
for( ; p; p = p->next) {
cout<<p->val<<" ";
}
cout<<endl;
}
int main() {
int a[5] = {1,2,3,2,1};
int b[6] = {1,2,4,3,2,1};
ListNode *head1 = init(a, 5);
ListNode *head2 = init(b, 6);
printList(head1);
printList(head2);
cout<<isPalindrome(head1)<<endl;
cout<<isPalindrome(head2)<<endl;
return 0;
}