/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { } };*/ class Solution { public: ListNode* ReverseList(ListNode* pHead) { if (pHead == nullptr) return nullptr; ListNode* cur = pHead; ListNode* pre = nullptr; ListNode* temp = nullptr; while (cur) { temp = cu...