【leetcode】 反转链表

反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题？

 

递归：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* reverseList(struct ListNode* head) {
   //如果链表为空或者链表中只有一个元素
    if(head == NULL || head->next == NULL)
    {
        return head;
    }
    else
    {
        //先反转后面的链表，走到链表的末端结点
        struct ListNode* newhead = reverseList(head->next);
        //再将当前节点设置为后面节点的后续节点
        head->next->next = head;
        head->next = NULL;
        
        return newhead;
    } 
}

 

非递归：

struct ListNode* reverseList(struct ListNode* head) {
    if (head==NULL){
        return 0;
    }
    struct ListNode* current = head;
    struct ListNode* after = head;
    struct ListNode* pre = head;
    if(current->next!=NULL){
        pre = current;
        current = current->next;
        after = current->next;
        current->next = pre;
    }
    while (after!=NULL){
        pre = current;
        current = after;
        after = current->next;
        current->next = pre;
    }
    head->next = NULL;
    return current;

}