(山东科技大学)Java基础算法框架.docx

Java1.虚函数public abstract class Shape {public abstract void center();public abstract void diameter();public abstract void area();}public class Square extends Shape2.接口package sumweight;public interface appliance {public int weight();}public class AirConditioner implements appliance3.链表package list;public class NodeT { public T data; public NodeT prev = null; public NodeT next = null; public boolean equals(NodeT node) { if (data.equals(node.data)) { return true; } return false; } public int hashCode() { return data.hashCode(); } public String toString() { return data.toString(); } } package list;public class TListT {private NodeT head; private NodeT tail; private int size; public TList() { head = new NodeT(); tail = new NodeT(); size = 0; } /** * 删除某个位置的对象 * @param index 删除位置 */ public void delete(int index) { if (isEmpty()) { System.out.println(The Doubly Linked List is empty); } else if(index 0 || index size - 1){ System.out.println(The wrong number); }else { NodeT theNode = head.next; for (int i = 0;null != theNode i index;i++) { theNode = theNode.next; } theNode.next.prev = theNode; theNode = theNode.next; size --; } } /** * 删除链表中与key值相同的元素 * @param key 要删除的值 */ public void delete(T key) { if (isEmpty()) { System.out.println(The Doubly Linked List is empty); } else { NodeT theNode = head.next; while (null != theNode) { if (theNode.data.equals(key)) { theNode.next.prev = theNode; theNode = theNode.next; size --; break; } theNode = theNode.next; } } } /** * 返回当前链表中对象的个数 * @return 对象的个数 */ public int size(){ return size; } /** * 判断链表是否为空 * @return 链表是否为空 */ public boolean isEmpty() { if (null == head.next || null == tail.prev) { return true; } return false; } /* public boolean isEmpty(){ return 0 == size; } */ /** * 在链表的最后插入对象 * @param node 要插入的对象 */ public void insert(NodeT node) { if (null == tail.p