反转链表

题目描述

输入一个链表，反转链表后，输出链表的所有元素

思路：用一个pre指向前一个结点 ，用 next指向当前结点

 next = head.next; head.next = pre; pre = head; head = next;

代码如下：

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
import java.util.Stack;
public class Solution {
    public ListNode ReverseList(ListNode head) {
         ListNode pre =null;
         ListNode next =null;
        while(head != null){
            next = head.next;
            head.next = pre;
            pre = head;
            head = next;
        }
        return pre;
    }
}