1.链表反转

一、迭代

 public static ListNode iterate(ListNode head){
        ListNode next,curr=head,prev=null;
        while (curr!=null){
            next=curr.next;
            curr.next=prev;
            prev=curr;
            curr=next;
        }
        return prev;
    }

二、递归

public static ListNode recursion(ListNode head){
        if (head==null||head.next==null){
            return head;
        }
        ListNode newHead=recursion(head.next);
        head.next.next=head;
        head.next=null;
        return newHead;
    }