数据结构JAVA语言描述第三篇上机练习题

1、3-16public interface back public void append(Object obj) throws Exception; public Object delete() throw Exception; public Object getFront() throw Exception; public boolean notEmpty();public class Forback implements back static final int defauleSize = 10; int front; int rear; int count; int maxSize;

2、Object data; int tag=0; public Forback() initiate(defauleSize); public Forback(int sz) initiate(sz); private void initiate(int sz) maxSize = sz; front = rear = 0; count = 0; data = new Objectsz; public void append(Object obj) throws Exception if (count > 0 && front = rear) throw new Excep

3、tion("出错了"); datarear=obj; rear=(rear+1)%maxSize; count+; tag=1; public Object delete() throws Exception if(count=0) throw new Exception("队列已空"); Object temp=datafront; front=(front+1)%maxSize; count-; tag=0; return temp; public Object getFront() throws Exception if(count=0) thro

4、w new UnsupportedOperationException("队列已空"); return datafront; public boolean notEmpty() return count!=0; public class Text_for_16 public static void main(Stringargs) int n=10; SeQueue m=new SeQueue(n); int temp=11; try for(int i=1;i<=n;i+) m.append(i); System.out.println();System.out.p

5、rintln( "取值: "+m.getFront(); System.out.println("删除: "+m.delete(); System.out.println("所得结果为 "+temp); m.append(temp); System.out.print(m.getFront()+" "); if(m.rear=m.front&&m.tag=0) System.out.println(""); else System.out.println("所得结果为&

6、quot;); m.delete(); System.out.println("所得的结果为:"); for(int i=0;i<n;i+) System.out.print(m.delete()+" "); catch(Exception e) System.out.print(e.getMessage(); 3-17public interface back public void append(Object obj)throws Exception; public Object delete()throws Exception; public

7、 Object getFront()throws Exception; public boolean notEmpty();public class tpback implements back static final int defauleSize = 10; int front; int rear; int count; int maxSize; Object data; int tag=0; public tpbak() initiate(defauleSize); public tpback(int sz) initiate(sz); private void initiate(in

8、t sz) maxSize = sz; front = rear = 0; count = 0; data = new Objectsz; public void append(Object obj) throws Exception if (count > 0 && front = (rear+1)%maxSize) throw new Exception("队列已空"); datarear=obj; front=(rear+1)%maxSize; count+; public Object delete() throws Exception if(

9、count=0) throw new Exception("队列空"); Object temp=datafront; front=(front+1)%maxSize; count-; return temp; public Object getFront() throws Exception if(count=0) throw new UnsupportedOperationException("已满"); return datafront; public boolean notEmpty() return count!=0; public class

10、 Test_for_17 public static void main(Stringargs) int n=10; SeQueue m=new SeQueue(n); int temp=11; try for(int i=1;i<=n;i+) m.append(i); System.out.println(); System.out.println("删除: "+m.delete(); System.out.println( "取值: "+m.getFront(); System.out.println("结果为 "+temp

11、); m.append(temp); System.out.print(m.getFront()+" "); if(m.rear=m.front&&m.tag=0) System.out.println("结果为"); else System.out.println("结果为); m.delete(); System.out.println("结果为:"); for(int i=0;i<n;i+) System.out.print(m.delete()+" "); catch(Exc

12、eption e) System.out.print(e.getMessage(); 3-18public interface dps public void push(Object obj)throws Exception; public Object pop()throws Exception; public Object getTop()throws Exception; public boolean notEmpty();public class Lindps implements dps Node head; int size;public void Lindps() head=nu

13、ll; size=0; public void push(Object obj) throws Exception head=new Node(obj,head); size+; public Object pop() throws Exception if(size=0) throw new Exception("鍫嗘爤宸茬"); Object obj=head.element; head=head.next; size-; return obj; public Object getTop() throws Exception return head.element; p

14、ublic boolean notEmpty() return head!=null; public class Dot Object element; Dot next; Dot(Node nexttval) next=nexttval; Dot(Object obj,Node nexttval) element=obj; next=nexttval; public Dot getNext() return next; public void setNext(Dot nexttval) next=nexttval; public Object getElement() return elem

15、ent; public void setElement(Object obj) element=obj; public String toString() return element.toString(); public class postback public static void postExp(String ch) throws Exception tpback s = new tpback(); Object x1, x2; s.push('#'); for (int i = 0; i <ch.length(); i+) x2 = ch.charAt(i);

16、 x1 = s.getTop(); if (x2.equals('+') | x2.equals('-') | x2.equals('*') | x2.equals('/')|x2.equals('#') if (x1.equals('#') s.push(x2); else if (x2.equals('*') | x2.equals('/') && (x1.equals('+') | x1.equals('-') s

17、.push(x2); else if (x2.equals('*') | x2.equals('/') && (x1.equals('*') | x1.equals('/') System.out.print(s.pop(); s.push(x2); else if (x2.equals('+') | x2.equals('-') System.out.print(s.pop(); if(s.getTop().equals('+')|s.getTop().equals('-') System.out.print(s.pop(); s.push(x2); if(x2.equals('#') System.out.print(s.pop(); if(s.getTop().equals('+')|s.getTop().equals('-') System.out.print(s.pop(); else System.out.print(x2); public class Test_for_18 public stati