每天一道LeetCode——反转链表

题目链接——反转链表

struct ListNode* reverseList(struct ListNode* head)
{
    struct ListNode* one = head;
    struct ListNode* two = NULL;
    while(one)
    {
        struct ListNode* three = one->next;
        one->next = two;
        two = one;
        one = three;
    }
    return two;
}