Java 解法 public class Solution { public ListNode ReverseList(ListNode head) { ListNode pre = null; ListNode cur = head; while(cur!=null){ ListNode next = cur.next; cur.next = pre; pre = cur; cur = next; } return pre; } }JavaScript 一般解法 function ReverseList(pHead) { let cur = pHead; let pre = null; wh...
