题解 | #反转链表#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return ListNode类
 */
struct ListNode* ReverseList(struct ListNode* head ) 
{
    // write code here
    struct ListNode* temp1;
    struct ListNode* temp2;
    struct ListNode* temp3;
    if (!head)
        return NULL;
    temp2 = head;
    temp1 = NULL;
    temp3 = temp2->next;
    while (temp2 != NULL)
    {
        temp2->next = temp1;
        temp1 = temp2;
        temp2 = temp3;
        temp3 = temp2->next;
    }
    return temp1;
}