设计算法计算两个多项式的和要求利用线性表.docx

1、设计算法计算两个多项式的和要求利用线性表第5次作业。作业在LinkedList中添加一个方法reverse，将链表倒置，要求算法的复杂性为O(size()public static void reverse(LList preList) Node p=preList.head,succ=null,front=null; while(p!=null) succ=p.getNext(); p.setNext(front); front=p; p=succ; preList.head=front; 实验1.实验目的熟悉线性表数组、链表的实现，熟悉用递归及循环方法解决问题。2.实验要求 设计算法计算两

2、个多项式的和，要求利用线性表。3.算法设计public static void addTwoPolynomial (ListADTlist1,ListADTlist2,ListADTlist3) ArrayEListIterator iterator1=(ArrayEListIterator)list1.iterator(); ArrayEListIterator iterator2=(ArrayEListIterator)list2.iterator(); list3.clear(); Item a,b; while(iterator1.hasNext()&iterator2.hasNext

3、() a=(Item)iterator1.getCurrent(); b=(Item)iterator2.getCurrent(); if(a.getExpn()b.getExpn() list3.add(a);iterator1.advance(); else if(a.getExpn()=b.getExpn() double c=a.getCoef()+b.getCoef(); if(c!=0) list3.add(new Item(c,a.getExpn(); iterator1.advance();iterator2.advance(); else list3.add(b);itera

4、tor2.advance(); while(iterator1.hasNext() a=(Item)iterator1.next(); list3.add(a); while(iterator2.hasNext() b=(Item)iterator2.next(); list3.add(b); 4.软件结构 ListADT addTwoPolynomial main interator5.程序清单public interface ListADT public boolean add(T object); public boolean add (int givenPosition, T obje

5、ct); public T remove (int givenPosition); public T remove (T object); public void clear( ) ; public boolean replace(int givenPosition, T object); public T getEntry( int givenPosition); public int size( ); public boolean isEmpty(); public boolean contains(T object); public String toString( ); public

6、Iterator iterator();-public interface Iterator /一个数据集合 /一个用于指向当前元素的指针 public boolean hasNext(); public Object next() ; public void add(Object object); public void remove() ;-public class ArrayIterator implements Iterator private Object data; private int count; private int current; public ArrayIterat

7、or(Object object,int size) data= object;count= size;current=0; public boolean hasNext() return currentcount; public Object next() if(!hasNext() return null; current+; return datacurrent-1; public void add(Object object) throw new UnsupportedOperationException (); public void remove() throw new Unsup

8、portedOperationException (); -public class AList implements ListADT private T data; private final int DEFAULT_CAPACITY=8; private int count; public AList ()/不带参数的构造函数 data =( T)new ObjectDEFAULT_CAPACITY ; count =0; public AList(int initialCapacity) /带参数的构造函数 data =( T)new ObjectinitialCapacity ; co

9、unt =0; public Iterator iterator() return new ArrayIterator(data,count); private void expandCapacity() T newData =( T)new Objectdata.length*2+1; for(int i=0;i=count| givenPosition givenPosition;j+)dataj= dataj-1; datagivenPosition=object; count+; return true; public T remove (T object) int i; for(i=

10、0;i=count&!datai.equals(object);i+);/查找要删除的元素 if(i=count) return null; /防止删除不存在的元素 T tmp=datai; for(int j=i;j=count)return null; T tmp=datagivenPosition; for(int j= givenPosition;j=count| givenPosition=count| givenPosition0) return null; return datagivenPosition; public int size( ) return count; pub

11、lic boolean isEmpty() return count=0; public boolean contains(T object) int i; for(i=0;i=count& !datai.equals(object);i+); return i!= count; public String toString( ) String str=; for(int i=0;i count;i+)str=str+datai.toString(); return str; public String toStringV( ) String str=; for(int i=0;i count

12、;i+)str=datai.toString()+str; return str; -public class ArrayEListIterator implements EListIterater private Object data; private int count; private int current; public ArrayEListIterator(Object object,int size) data=object; count=size; current=0; public boolean hasNext() return current=0; public Obj

13、ect getCurrent() return datacurrent; public void setStrat() current=0; public void setEnd() current=count-1; public void setPos(int pos) current=pos; Override public Object previos() / TODO Auto-generated method stub return null; Override public int nextIndex() / TODO Auto-generated method stub retu

14、rn 0; Override public int previosIndex() / TODO Auto-generated method stub return 0; Override public void set(Object object) / TODO Auto-generated method stub Override public boolean isInList() / TODO Auto-generated method stub return false; Override public boolean setStart() / TODO Auto-generated m

15、ethod stub return false; -public class Item private double coef; private int expn; public Item(double coef,int expn) this.coef=coef; this.expn=expn; public double getCoef()return coef; public int getExpn() return expn; -import java.util.Scanner;public class Test public static void main(String args)

16、int a1=1,2,3; int a2=1,2,3; int b1=4,5,6; int b2=4,5,6; AList list1=new AList (); AList list2=new AList (); AList list3=new AList (); for(int i=0;ia1.length;i+) list1.add(new Item(a1i,a2i); list2.add(new Item(b1i,b2i); addTwoPolynomial (list1,list2,list3); System.out.println(addition is:+list3.toStr

17、ing(); public static void addTwoPolynomial (ListADTlist1,ListADTlist2,ListADTlist3) ArrayEListIterator iterator1=(ArrayEListIterator)list1.iterator(); ArrayEListIterator iterator2=(ArrayEListIterator)list2.iterator(); list3.clear(); Item a,b; while(iterator1.hasNext()&iterator2.hasNext() a=(Item)ite

18、rator1.getCurrent(); b=(Item)iterator2.getCurrent(); if(a.getExpn()b.getExpn() list3.add(a);iterator1.advance(); else if(a.getExpn()=b.getExpn() double c=a.getCoef()+b.getCoef(); if(c!=0) list3.add(new Item(c,a.getExpn(); iterator1.advance();iterator2.advance(); else list3.add(b);iterator2.advance(); while(iterator1.hasNext() a=(Item)iterator1.next(); list3.add(a); while(iterator2.hasNext() b=(Item)iterator2.next(); list3.add(b);