/* struct ListNode { int val; struct ListNode next; ListNode(int x) : val(x), next(NULL) { } };/ class Solution { public: ListNode* ReverseList(ListNode* pHead) { //采用头插法进行链表的反转 ListNode* p=pHead; if(p==NULL){ cout <<"NULL"<<endl; }else{ ListNode* s=p->next; while(s!=NULL){ p->next...