题解 | #反转链表#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
		stack<int> s;
		ListNode *p = new ListNode(0);
		p = pHead;
		while (p!=nullptr) {
			s.push(p->val);
			p = p->next;
		}
		if(s.empty()) return NULL;
		pHead->val = s.top();
		s.pop();
		p = pHead;
		while (!s.empty()) {
			ListNode *temp = new ListNode(0);
			temp->val = s.top();
			s.pop();
			p->next = temp;
			p = temp;
		}
		return pHead;
    }
};