题解 | #反转链表C语言#双指针

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