[英]Reversing a singly linked list iteratively
必须为O(n)并就地(空间复杂度为1)。 下面的代码可以工作,但是有没有更简单或更完善的方法?
public void invert() {
if (this.getHead() == null)
return;
if (this.getHead().getNext() == null)
return;
//this method should reverse the order of this linked list in O(n) time
Node<E> prevNode = this.getHead().getNext();
Node<E> nextNode = this.getHead().getNext().getNext();
prevNode.setNext(this.getHead());
this.getHead().setNext(nextNode);
nextNode = nextNode.getNext();
while (this.getHead().getNext() != null)
{
this.getHead().getNext().setNext(prevNode);
prevNode = this.getHead().getNext();
this.getHead().setNext(nextNode);
if (nextNode != null)
nextNode = nextNode.getNext();
}
this.head = prevNode;
}
编辑以删除每次迭代的额外比较:
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;
}
}
与LinkedList的此实现一起使用: https : //stackoverflow.com/a/25311/234307
public void reverse() {
Link previous = first;
Link currentLink = first.nextLink;
first.nextLink = null;
while(currentLink != null) {
Link realNextLink = currentLink.nextLink;
currentLink.nextLink = previous;
previous = currentLink;
first = currentLink;
currentLink = realNextLink;
}
}
这个怎么样:
public void invert() {
if (head != null) {
for (Node<E> tail = head.getNext(); tail != null; ) {
Node<E> nextTail = tail.getNext();
tail.setNext(head);
head = tail;
tail = nextTail;
}
}
}
使用一个独立的实现,即List由头Node表示:
public class Node<E>
{
Node<E> next;
E value;
public Node(E value, Node<E> next)
{
this.value = value;
this.next = next;
}
public Node<E> reverse()
{
Node<E> head = null;
Node<E> current = this;
while (current != null) {
Node<E> save = current;
current = current.next;
save.next = head;
head = save;
}
return head;
}
}
public void reverse(){
Node middle = head;
Node last = head;
Node first = null;
while(last != null){
middle = last;
last = last.next;
middle.next = first;
first = middle;
}
head = middle;
}
public void invert() {
if (first == null) return;
Node<E> prev = null;
for ( Node<E> next = first.next; next != null; next = first.next) {
first.next = prev;
prev = first;
first = next;
}
first.next = prev;
}
修改节点类
您可以覆盖Node类中的toString方法以输入任何数据
public class Node { public Node node; private int data; Node(int data) { this.data = data; } @Override public String toString() { return this.data+""; }
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.