题解 | #反转链表#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

/**
 * 
 * @param pHead ListNode类 
 * @return ListNode类
 */
struct ListNode* ReverseList(struct ListNode* pHead ) {
    // write code here
    if(pHead==NULL||pHead->next==NULL){
        return pHead;
    }
    struct ListNode* pFirst;
    struct ListNode* pTem;
    pFirst = pHead;
    pTem = pFirst;
    while(pFirst->next!=NULL){
        pTem = pHead;
        pHead = pFirst->next;
        pFirst->next = pHead->next;
        pHead->next = pTem;
        
    }
    return pHead;

}