234. Palindrome Linked List

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 static int wing=[]()
10 {
11     std::ios::sync_with_stdio(false);
12     cin.tie(NULL);
13     return 0;
14 }();
15 
16 class Solution 
17 {
18 public:
19     bool isPalindrome(ListNode* head) 
20     {
21         stack<int> istack;
22         ListNode *pr=head;
23         while(pr)
24         {
25             istack.push(pr->val);
26             pr=pr->next;
27         }         
28         while(head)
29         {
30             if(head->val!=istack.top())
31                 return false;
32             head=head->next;
33             istack.pop();
34         }
35         return true;
36     }
37 };