翻转链表 时间复杂度:O(1) 图解: public Node reverseList(Node head){ //初始化prev=null,cur=head Node prev = null; Node cur = head; // while循环,条件,cur=null while(cur != null){ Node temp = cur.next;//记录cur.next cur.next = prev;//翻转指向 prev = cur;//后移prev cur = temp;// 后移cur } return prev; }