反转链表

leetcode 206反转链表

迭代法

public ListNode reverseList(ListNode head) {
		ListNode root = null;//前指针
        ListNode cur = head;//当前指针
        while (cur != null){
            ListNode nextTemp = cur.next; //临时节点，暂存当前节点的下一节点，用于后移
            cur.next = root; //将当前节点指向它前面的节点
            root = cur; //前指针后移
            cur = nextTemp;

        }
        return root;
}

递归法

public ListNode reverseList(ListNode head) {
        return reverse(null,head);
    }
private ListNode reverse(ListNode pre,ListNode cur){
        if(cur==null) return pre;
        ListNode next = cur.next;
        cur.next = pre;
        return reverse(cur,next);
}