| Java 双向链表
|
 减小字体
 增大字体
|
问题：以下是部分代码：请实现public class DoubleLinkList { Object data; DoubleLinkList prev; //前驱引用 DoubleLinkList next; //后继引用 public DoubleLinkList() { } public DoubleLinkList(Object obj) { data = obj; } public DoubleLinkList(Object obj, DoubleLinkList prevlink, DoubleLinkList nextlink) { data = obj; prev = prevlink; next = nextlink; } public void insert(Object val, DoubleLinkList prior) { DoubleLinkList ins = new DoubleLinkList(val); if (prior == null) { ins.next = head; head = ins; if (tail == null) { tail = ins; } else { ins.next.prev = ins; } } else { ins.next = prior.next; prior.next = ins; if (prior == tail) { tail = ins; } else { ins.next.prev = ins; } ins.prev = prior; } } public void delete(DoubleLinkList del) { if (del == head) { del = head.next; if (del == tail) { tail = null; } else { head.prev = null; } } else { del.prev.next = del.next; if (del == tail) { tail = del.prev; } else { del.next.prev = del.prev; } } }
实现什么东西?什么要求都不说,这样问问题...
如果你对以下是部分代码：请实现public class DoubleLinkList { Object data; DoubleLinkList prev; //前驱引用 DoubleLinkList next; //后继引用 public DoubleLinkList() { } public DoubleLinkList(Object obj) { data = obj; } public DoubleLinkList(Object obj, DoubleLinkList prevlink, DoubleLinkList nextlink) { data = obj; prev = prevlink; next = nextlink; } public void insert(Object val, DoubleLinkList prior) { DoubleLinkList ins = new DoubleLinkList(val); if (prior == null) { ins.next = head; head = ins; if (tail == null) { tail = ins; } else { ins.next.prev = ins; } } else { ins.next = prior.next; prior.next = ins; if (prior == tail) { tail = ins; } else { ins.next.prev = ins; } ins.prev = prior; } } public void delete(DoubleLinkList del) { if (del == head) { del = head.next; if (del == tail) { tail = null; } else { head.prev = null; } } else { del.prev.next = del.next; if (del == tail) { tail = del.prev; } else { del.next.prev = del.prev; } } }这个问题有好的意见或
建议，请留言
|
|
[]
[返回上一页]
[打 印]
|
|
|
您当前的位置：
百科371 → 电脑/网络 → JAVA相关 → 电脑/网络内容
退出登录