根据您的要求,我将循环双链表代码修改为双链表代码,并保持方法不增加或减少,并尽量保持修改幅度较小。
public class DoublyList<T> {
public DoubleNode<T> head;
public DoublyList() {
this.head = new DoubleNode<T>();
this.head.prev = null;
this.head.next = null;
}
public boolean isEmpty() {
return this.head.next == null;
}
public String toString() { // 遍历
String str = this.getClass().getName() + "(";
for (DoubleNode<T> p = this.head.next; p != null; p = p.next)
str += p.data.toString() + ((p.next != null) ? "," : "");
return str + ")";
}
public DoubleNode<T> insert(int i, T x) { // 插入
if (x == null || i < 0)
return null;
int j = 0;
DoubleNode<T> front = this.head;
while (j < i && front.next != null) {
front = front.next;
j++;
}
DoubleNode<T> q = new DoubleNode<T>(x, front, front.next);
if (front.next != null)
front.next.prev = q;
front.next = q;
return q;
}
public DoubleNode<T> insert(T x) {
if (x == null)
return null;
DoubleNode<T> q = new DoubleNode<T>(x, head, head.next);
if (head.next != null)
head.next.prev = q;
head.next = q;
return q;
}
public void addAll(DoublyList<T> list) {
for (DoubleNode<T> p = list.head.next; p != null; p = p.next)
this.insert(p.data);
}
public static void main(String[] args) {
DoublyList<Integer> list1 = new DoublyList<Integer>();
DoublyList<Integer> list2 = new DoublyList<Integer>();
for (int i = 6; i <= 10; i++)
list1.insert(i);
for (int i = 11; i <= 15; i++)
list2.insert(i);
System.out.println(list1.toString());
System.out.println(list2.toString());
list1.addAll(list2);
System.out.println(list1.toString());
}
}
这是修改后的双链表代码,仅将循环双链表改为了普通双链表,并保持了原有的方法和逻辑不变。
内容由零声教学AI助手提供,问题来源于学员提问




