题目:
Given a singly linked list, determine if it is a palindrome.
Example 1:
Input: 1->2 Output: false
Example 2:
Input: 1->2->2->1 Output: true
Follow up:
Could you do it in O(n) time and O(1) space?
代码:
/**
* 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) {
stack<ListNode*> nodes;
ListNode* p = head, *q = NULL;
while(p != NULL)
{
nodes.push(p);
p=p->next;
}
p = head;
while(!nodes.empty())
{
q = nodes.top();
if(p->val != q->val)
return false;
p = p->next;
nodes.pop();
}
return true;
}
};
一次AC~