LinkNode last = null;while(L.hasNext()) { node = L.next(); Node newnode = node.clone(); newnode.setNext(last); last = newnode;}return last; //last是逆置的链表的头结点
