链表倒置

插入法

    public ListNode ReverseList(ListNode head) {
            ListNode pre = null;
            ListNode next = null;//利用next来原来链表之后的内容
            while(head != null){
                next = head.next;
                head.next = pre; //把前面结点的放到当前结点的后面
                pre = head;//再将内容保存到pre中
                head = next;
            }
            return pre;   
        }