LeetCode_206_ 反转链表

双指针法：

视频讲解

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* reverseList(struct ListNode* head){
    struct ListNode* left = NULL;    
    struct ListNode* now = head;
    while(now != NULL){
        struct ListNode* right;
        right = now->next;
        now->next = left;
        left = now;
        now = right;
    }
    return left;
}