每日编程-20170412

 1 #include <stack>
 2 using namespace std;
 3 
 4 struct ListNode {
 5 int val;
 6 struct ListNode *next;
 7 ListNode(int x) : val(x), next(NULL) {}
 8 };
 9 
10 class PalindromeList {
11 public:
12     bool chkPalindrome(ListNode* A) {
13         // write code here
14         bool answer = true;
15         ListNode *p = A;
16         stack<int> s;
17         while (p)
18         {
19             s.push(p->val);
20             p = p->next;
21         }
22         p = A;
23         while (p)
24         {
25             if (s.top()!= p->val)
26             {
27                 answer = false;
28                 break;
29             }
30             s.pop();
31             p = p->next;
32         }
33         return answer;
34     }
35 };