import java.util.*;
public class LinkedList { private LinkedListNode head = new LinkedListNode("head", null, null);
public LinkedList() {
head.next = head.previous = head;
}
public LinkedListNode getFirst() {
LinkedListNode node = head.next;
if (node == head) {
return null;
}
return node;
}
public LinkedListNode getLast() {
LinkedListNode node = head.previous;
if (node == head) {
return null;
}
return node;
}
public LinkedListNode addFirst(LinkedListNode node) {
node.next = head.next;
node.previous = head;
node.previous.next = node;
node.next.previous = node;
return node;
}
public LinkedListNode addFirst(Object object) {
LinkedListNode node = new LinkedListNode(object, head.next, head);
node.previous.next = node;
node.next.previous = node;
return node;
}
public LinkedListNode addLast(Object object) {
LinkedListNode node = new LinkedListNode(object, head, head.previous);
node.previous.next = node;
node.next.previous = node;
return node;
}
public void clear() {
//Remove all references in the list.
LinkedListNode node = getLast();
while (node != null) {
node.remove();
node = getLast();
}
}
public String toString() {
LinkedListNode node = head.next;
StringBuffer buf = new StringBuffer();
while (node != head) {
buf.append(node.toString()).append(", ");
node = node.next;
}
return buf.toString();
}
}不知道楼主要的是不是这个~~
public class LinkedList { private LinkedListNode head = new LinkedListNode("head", null, null);
public LinkedList() {
head.next = head.previous = head;
}
public LinkedListNode getFirst() {
LinkedListNode node = head.next;
if (node == head) {
return null;
}
return node;
}
public LinkedListNode getLast() {
LinkedListNode node = head.previous;
if (node == head) {
return null;
}
return node;
}
public LinkedListNode addFirst(LinkedListNode node) {
node.next = head.next;
node.previous = head;
node.previous.next = node;
node.next.previous = node;
return node;
}
public LinkedListNode addFirst(Object object) {
LinkedListNode node = new LinkedListNode(object, head.next, head);
node.previous.next = node;
node.next.previous = node;
return node;
}
public LinkedListNode addLast(Object object) {
LinkedListNode node = new LinkedListNode(object, head, head.previous);
node.previous.next = node;
node.next.previous = node;
return node;
}
public void clear() {
//Remove all references in the list.
LinkedListNode node = getLast();
while (node != null) {
node.remove();
node = getLast();
}
}
public String toString() {
LinkedListNode node = head.next;
StringBuffer buf = new StringBuffer();
while (node != head) {
buf.append(node.toString()).append(", ");
node = node.next;
}
return buf.toString();
}
}不知道楼主要的是不是这个~~
http://blog.csdn.net/treeroot/archive/2004/09/18/108790.aspx
THAN USING THE LinkedList CLASS WHICH IS PRE-DEFINED IN THE
JAVA API.
Any use of
java.util.LinkedList java.util.Stack
java.util.Vector java.util.Collections
java.util.ArrayList
java.util.Arrays
WILL RESULT IN THE ENTIRE ASSIGNMENT BEING AWARDED A MARK OF
0 (ZERO), REGARDLESS OF CORRECT EXECUTION.
THERE WILL BE NO EXCEPTIONS TO THIS REQUIREMENT UNDER ANY
CIRCUMSTANCES.