Question

用JAVA语言解决：编写一个链表类(双向链表),实现插入,删除,查找操作

如题，最好是完整的已调试好的程序，急用谢谢，学的的C++，要用JAVA就无奈了

Answer 1

public class DoubleLinkedList
{
// 节点类Node

private static class Node
{
Object value;
Node prev = this;
Node next = this;

Node(Object v)
{
value = v;
}

public String toString()
{
return value.toString();
}
}
private Node head = new Node(null); // 头节敬绝点
private int size; /喊稿态郑源/ 链表大小
// 以下是接口方法

public boolean addFirst(Object o)
{
addAfter(new Node(o), head);
return true;
}

public boolean addLast(Object o)
{
addBefore(new Node(o), head);
return true;
}

public boolean add(Object o)
{
return addLast(o);
}

public boolean add(int index, Object o)
{
addBefore(new Node(o), getNode(index));
return true;
}

public boolean remove(int index)
{
removeNode(getNode(index));
return true;
}

public boolean removeFirst()
{
removeNode(head.next);
return true;
}

public boolean removeLast()
{
removeNode(head.prev);
return true;
}

public Object get(int index)
{
return getNode(index).value;
}

public int size()
{
return size;
}

public String toString()
{
StringBuffer s = new StringBuffer("[");
Node node = head;
for (int i = 0; i < size; i++)
{
node = node.next;
if (i > 0)
s.append(", ");
s.append(node.value);
}
s.append("]");
return s.toString();
}

private Node getNode(int index)
{
if (index < 0 || index >= size)
throw new IndexOutOfBoundsException();
Node node = head.next;
for (int i = 0; i < index; i++)
node = node.next;
return node;
}

private void addBefore(Node newNode, Node node)
{
newNode.next = node;
newNode.prev = node.prev;
newNode.next.prev = newNode;
newNode.prev.next = newNode;
size++;
}

private void addAfter(Node newNode, Node node)
{
newNode.prev = node;
newNode.next = node.next;
newNode.next.prev = newNode;
newNode.prev.next = newNode;
size++;
}

private void removeNode(Node node)
{
node.prev.next = node.next;
node.next.prev = node.prev;
node.prev = null;
node.next = null;
size--;
}
}

//测试类：

public class Test
{
public static void main(String[] args)
{
DoubleLinkedList dll = new DoubleLinkedList();
//添加
dll.add("张三");
dll.add("李四");
dll.add("王五");
System.out.println(dll);

//添加到最前
dll.addFirst("孙七");
System.out.println(dll);

//添加到最后，同添加
dll.addLast("赵六");
System.out.println(dll);

//添加到指定位置
dll.add(4, "王祖贤");
System.out.println(dll);

//移除最前的
dll.removeFirst();
System.out.println(dll);

//移除最后的
dll.removeLast();
System.out.println(dll);

//移除指定位置上的
dll.remove(2);
System.out.println(dll);

//返回指定位置上的元素
System.out.println(dll.get(1));

}
}