/* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ public class Solution { public ListNode ReverseList(ListNode head) { ListNode pre = null; ListNode next = null; while(head!=null){ //使用next节点保存head.next next = head.next; //反转：建立head到pre的指向 head.next ...
