编辑以删除每次迭代的额外比较：
public void invert() { Node<E> prev = null, next = null;; if (head == null) return; while (true) { next = head.getNext(); head.setNext(prev); prev = head; if (next == null) return; head = next; } }
编辑以删除每次迭代的额外比较：
public void invert() { Node<E> prev = null, next = null;; if (head == null) return; while (true) { next = head.getNext(); head.setNext(prev); prev = head; if (next == null) return; head = next; } }名师互学网 版权所有 (c)2021-2022 ICP备案号：晋ICP备2021003244-6号
