NC78 反转链表（C++）- 简单、链表

题目链接：https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=196&rp=1&ru=%2Fexam%2Foj&qru=%2Fexam%2Foj&sourceUrl=%2Fexam%2Foj%3Fpage%3D2%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D196&difficulty=&judgeStatus=&tags=&title=78&gioEnter=menu
题目如下：

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