题解 | #反转链表#

public class ListNode
{
    public int val;
    public ListNode next;
    public ListNode (int x)
    {
        val = x;
    }
}*/
class Solution
{
    public ListNode ReverseList(ListNode pHead)
    {
        // write code here
        if(pHead==null || pHead.next==null){
            return pHead;
        }
        ListNode temp=pHead.next;
        ListNode pp=temp.next;
        pHead.next=null;
        while(pp!=null){
            temp.next=pHead;
            pHead=temp;
            temp=pp;
            pp=pp.next;
        }
        temp.next=pHead;
        return temp;
    }
}