package com.線性表.順序表;/**? * 順序表ArrayList,用數(shù)組表示。一組連續(xù)的地址空間8? * @author LH-PC9? * @param <E>10? */?public class ArrayLists {???? private Object[] data = null; //data 用來保存此線性表的數(shù)據(jù)域???? private int length; //線性表的容量???? private int current;//實(shí)際表長??? ????? //設(shè)置長度?public ArrayLists(int a){?? ?if(a>=0){?? ??? ?length=a;?? ??? ?this.data=new Object[a];?? ??? ?current=a;?? ?}else{?? ??? ?throw new IndexOutOfBoundsException("初始長度不能小于0");?? ?}?}public ArrayLists(){?? ? this(10);}//判斷表容量是否超出預(yù)定大小，如果超出將自動(dòng)擴(kuò)充容量public void expansion(){?? ?if(current>=length){?? ??? ?length=current*2;}}//添加元素public void add(Object a){?? ?expansion();?? ?this.data[++current]=a;}//刪除元素public void remove(int index){?? ?if(index>=current){?? ??? ?throw new IndexOutOfBoundsException("下標(biāo)超出表長");?? ?}?? ?for(int i=0;i<current-1;i++){?? ??? ?data[i]=data[i+1];?? ?}?? ?data[current-1]=null;?? ?--current;}//按下標(biāo)返回元素值public boolean get(int i){?? ?if(i>=current&&i<0){?? ??? ?throw new IndexOutOfBoundsException("輸入的下標(biāo)不存在");?? ?}else{?? ??? ?System.out.println(data[i]);?? ??? ?return true;?? ?}?? ?}//返回實(shí)際表長public int size(){?? ?return this.current;}//返回容量public void length(){?? ?System.out.println(this.length);}public String isEmpty(){?? ?if(this.current==0){?? ??? ?return "空";?? ?}else{?? ?return "非空";?? ??? ?}?? ?}public static void main(String[] args) {?? ?ArrayLists? arr1 =new ArrayLists(122);?? ?arr1.add("java");?? ?arr1.add("php");?? ?arr1.add("c");?? ?arr1.add("c++");?? ?for(int i=0;i<arr1.size();i++){?? ??? ?System.out.print(arr1.get(i));?? ?}}?}代碼35行報(bào)錯(cuò)不知道為什么