2.1问题:
编写代码,移除未排序链表中的重复节点。
方法一:可使用临时缓冲区情况下,可用简单的散列表记录节点并判断是否重复。
import java.util.*;
//节点类
class Node {
protected Node next; //指针域
protected int data;//数据域
public Node( int data) {
this.data = data;
}
//显示此节点
public void display() {
System. out.print( data + " ");
}
}
//单链表
class LinkList {
public Node first; // 定义一个头结点
private int pos = 0;// 节点的位置
public LinkList() {
this.first = null;//this代表当前类
}
// 插入一个头节点
public void addFirstNode( int data) {
Node node = new Node(data);
node. next = first;
first = node;
}
// 删除一个头结点,并返回头结点
public Node deleteFirstNode() {
Node tempNode = first;
first = tempNode. next;
return tempNode;
}
// 在任意位置插入节点 在index的后面插入
public void add(int index, int data) {
Node node = new Node(data);
Node current = first;
Node previous = first;
while ( pos != index) {
previous = current;
current = current. next;
pos++;
}
node. next = current;
previous. next = node;
pos = 0;
}
// 删除任意位置的节点
public Node deleteByPos( int index) {
Node current = first;
Node previous = first;
while ( pos != index) {
pos++;
previous = current;
current = current. next;
}
if(current == first) {
first = first. next;
} else {
pos = 0;
previous. next = current. next;
}
return current;
}
// 根据节点的data删除节点(仅仅删除第一个)
public Node deleteByData( int data) {
Node current = first;
Node previous = first; //记住上一个节点
while (current. data != data) {
if (current. next == null) {
return null;
}
previous = current;
current = current. next;
}
if(current == first) {
first = first. next;
} else {
previous. next = current. next;
}
return current;
}
// 显示出所有的节点信息
public void displayAllNodes() {
Node current = first;
while (current != null) {
current.display();
current = current. next;
}
System. out.println();
}
// 根据位置查找节点信息
public Node findByPos( int index) {
Node current = first;
if ( pos != index) {
current = current. next;
pos++;
}
return current;
}
// 根据数据查找节点信息
public Node findByData( int data) {
Node current = first;
while (current. data != data) {
if (current. next == null)
return null;
current = current. next;
}
return current;
}
}
class deleteDups{
public static void main(String args[]){
LinkList linkList = new LinkList();
linkList.addFirstNode(19);//19
linkList.addFirstNode(18);//18,19
linkList.addFirstNode(15);//15,18,19
linkList.add(1, 16); //15,16,18,19
linkList.add(2, 17); //15,16,17,18,19
linkList.add(3, 17); //15,16,17,17,18,19
linkList.displayAllNodes();
deleteDups(linkList.first);
linkList.displayAllNodes();
}
public static void deleteDups(Node n){
Hashtable<Object,Object> table = new Hashtable<Object,Object>();
Node previous = null;
while(n!=null){
if(table.containsKey(n.data)){
previous.next=n.next;
}
else{
table.put(n.data,true);
previous=n;
}
n=n.next;
}
}
}
方法二:如果不得使用临时缓冲区,该怎么解决?可以用两个指针来迭代(快行指针技巧):current迭代访问整个链表,runner用于检查后续的节点是否重复。
public static void deleteDups(Node head){
if(head == null) return;
Node current = head;
while(current!=null){
Node runner=current;
while(runner.next!=null){
if(runner.next.data==current.data){
runner.next=runner.next.next;
}else{
runner = runner.next;
}
}
current=current.next;
}
}
这段代码空间复杂度为O(1),时间复杂度为O(N^2)。