test1.java

来自「以数组为存储结构保存线性表」· Java 代码 · 共 45 行

import java.awt.*;
import java.lang.*;

public class test1{ 
	public static void main (String args[]){ 

		String[] L={"aa","bb","dd","ee","ff","gg","hh"};
		SequenceList MyList=new SequenceList(L);
		//SequenceList MyList=new SequenceList();
		/*MyList.add("aa");
		MyList.add("bb");
		MyList.add("dd");
		MyList.add("ee");
		MyList.add("ff");
		MyList.add("gg");
		MyList.add("hh");*/
		System.out.println("当前顺序表：" );
		MyList.display();
		
		MyList.add(3,"cc");
		System.out.println("添加完cc后的顺序表: " );
		MyList.display();
				
		System.out.println("第二个元素的值"+MyList.getEntry(2));
		
		if(MyList.contains("ii"))
		    System.out.println("顺序表存在ii");
		else
			System.out.println("顺序表不存在ii");
			
		if(MyList.isFull())
			System.out.println("数组没满");
		else
			System.out.println("数组满了");
			
		MyList.remove(6);
		
		MyList.replace(1,"jj");
		
		System.out.println("最终数据表：");
		MyList.display();
		

	} 
}