题目:给定单向链表的头指针和一个节点指针,定义一个函数在O(1)时间删除该节点.
public class DeleteNode {
/*
* 要求时间复杂度O(1),只要被删除节点不是最后一个都可以O(1)
* 如果是最后一个,并且链表中不止一个节点,依旧需要O(n)的复杂度、
* 但是整体是O(1)
* 这里头结点是无意义的.
*/
public static void deleteNode(Node head,Node toDelete){
if(head==null || toDelete==null)
return;
if(toDelete.getNext()!=null){
//正常情况
toDelete.setData(toDelete.getNext().getData());
toDelete.setNext(toDelete.getNext().getNext());
}else{
//有多个节点,并且要删除的是尾节点
Node temp = head;
while(temp.getNext()!=toDelete)
temp = temp.getNext();
temp.setNext(null);
}
}
}
class Node{
private Integer data;
private Node next;
public Integer getData() {
return data;
}
public void setData(Integer data) {
this.data = data;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}
public Node() {
super();
}
public Node(Integer data) {
this.data = data;
next = null;
}
@Override
public String toString() {
return "Node [data=" + data + "]";
}
}