思路:把链表遍历,遍历的时候,取当前节点的前一个节点和后一个节点作为临时的中转站,就可以把链表翻过来接。有空明天再说。 public class LinkedList { public static ListNode reverseLikedList(ListNode head){ if(head == null)return head; ListNode current, next ,pre; current = head; pre = null; while (current.next != null) { next = current.next; current.next = pre; pre = current; current = next; } current.next = pre; return current; } } class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }