2020-09-18

public SeqLíst(int size)(initiate (size);

private void initiate(int sz)ímaxSize=sz;

size=0;

listArray=new Object[sz];

1/在i位置插人元素

public void insert (int i,object obj) throws Exceptionif (size==maxSize) 1

throw new Exception ("顺序表已满而无法插人!”);

if (i<011 i >size)l

throw new Exeptiost1

//在i位置插入元素

public void insert (int i,Object obj) throws Exception{if(size==maxSize) {

throw new Exception (顺序表已满而无法插入!");

if (i<011 i >size){

throw new Exception(“参数错误!”);

for(int j=size; j >i; j–)l

listArray[j]-listArraylj- 1];

listArray[i]=obj;size++ ;

//删除位置i的元素

public object delete (inti) throws Exceptioni

if (size==0) i

throw new Exception (“йŸ*E È ЛìЕЛНѬ!”);

f(i<01L i> size-1) l

throw new Exception(“Ê#B!”) ;

object it=listArray[i] ;

for(int j=i;j <size-1; j++) l

listArray[jl=listArray[j+11 ;

size-- ;return it;

//取i位置的数据元素

fordint j=i; j <size-1;う十十)

listarraylil-listarray[j+1;

return it;

//取i位置的数据元素

public object getData(int i) throws Except oif(i <0 1 i >=size){

throw new Exception(“参数措俣!”);

return listArray[il;

//求元素个数

public int size() {return size;

//確定是否カ空

public boolean isEmpty0 {return size–0;

public void print () throws Exception{System.out.println(“順序表元素カ:”);for (int i=0; i<size; i++) {

System. out.print (getData(i)+"

");

//建立一个銭性表，依次輸人数据元素1、2、3…10,刪除元素5, 最后星示当前元素

publicclassSeqListTest{

public static void main(strinI args[]) {

SeqListseotio_

int n=10;

lst-new SeqList (100);

try{

for(int i=0; i <n; 1++)(

seqlist. insert(i,new Integer(i+1));

seqList.print() ;

//删除第5个元素

seqList.delete (4) ;

System.out.println() ;

System.out.print(“删除后”);seqList.print();

catch (Exception e){

System.out.println(e.getMessage());