LeetCode-206-反转链表

反转一个单链表。

示例:

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

简单题，两种方法，遍历+递归

class Solution {
     public ListNode reverseList(ListNode head) {
         ListNode prev = null;
         ListNode curr = head;
         while(curr!=null){
             ListNode temp = curr.next;
             curr.next = prev;
             prev = curr;
             curr = temp;
         }
         return prev;
     }
}

 

class Solution {
    public ListNode reverseList(ListNode head) {
        if(head==null || head.next==null){
            return head;
        }
        ListNode result = reverseList(head.next);
        head.next.next = head;
        head.next = null;
        return result;
    }
}