实验报告4通过使用接口和抽象类设计一个可复用的类库.doc

成绩辽宁工程技术大学上机实验报告4实验名称通过使用接口和抽象类设计一个可复用的类库院系姓名实验目的简述本次实验目的：通过使用接口和抽象类设计一个可复用的类库实验准备你为本次实验做了哪些准备： 阅读教材,并跟随老师学习并掌握用抽象类和接口的方法实现栈,队列,链表,;并比较两种方法的异同之处.实验进度本次共有 1 个练习，完成 1 个。实验总结日本次实验的收获、体会、经验、问题和教训： 通过课堂上跟随老师学习，课后认真阅读教材，跟同学讨论实验结果，上网查阅C#中接口的相关资料，通过周一下午的上机操作和其他时间的上机练习，把不会的问题都弄懂，终于完成了实验报告上的实验问题，以下是实验问题的具体实现过程。教师评语interface Icollection void insert(int v); int delete (int p ); int seek (int p); interface Iaction void insert(int v); int delete(); int seek(int p); public abstract class collection public abstract void insert(int v); public abstract int delete(); public abstract int seek(int t); class stack : collection,Iaction private Linklist L; public int Num get return L.Num; public override void insert(int v) L.insert (v); public override int delete() return L.delete(0); public override int seek(int p) return L.seek(p); class queue : collection,Iaction private Linklist L; private int num; public int Num get return L.Num; public queue() L = new Linklist(); public override void insert(int v) L.insert( v); public override int delete() return L.delete(0); public override int seek(int p) return L.seek(p); class Node private int data; public int Data get return data; set data = value; public Node(int v) this.data = v; public Node next; class Linklist : collection,Icollection public Node head; private int num; public int Num get return num; public Linklist() head = null; num = 0; public bool isempty() if (num = 0) return true; else return false; public override void insert(int v) insert(v); public void insert(Node A) if (isempty() head = A; head.next = null; else A.next = head; head = A; num = num + 1; Console.WriteLine(操作成功！); public override int delete() return delete(-1); public int delete(int p) if (isempty() Console.WriteLine(Error); else Node p; Node q; p = q = head; while (p.next != null) q = p; p = p.next; int v = p.Data; q.next = null; Console.WriteLine(删除0, v); num = num - 1; public override int seek(int p) int i = 0; Node p = head; while (p != null) p = p.next; i+; public void TraverseList() Node p = head; int t = num; if (num = 0) Console.WriteLine(Null); while (t != 0) Console.WriteLine(p.Data); p = p.next; t = t - 1; class Program static void Main(string args) stack s = new stack(); for (int i = 1; i = 5; i+) s.insert(i); for (int i = 0; i = s.Num; i+) Console.Write(0, s.seek(i); Console.WriteLine(); queue a = new queue(); for (int i = 1; i = 5; i+) a.insert(i); for (int i = 0; i = a.Num; i+) Console.Write(0, a.delete(); Console.WriteLine()