seqlist.java

基本的数据结构的java代码

public class SeqList implements List{
	final int defaultSize = 10;
	
	int maxSize;
	int size;
	Object[] listArray;
	
	SeqList(){
		initiate(defaultSize);
	}
	
    SeqList(int size){
		initiate(size);
	}
	
	public void initiate(int sz){
		maxSize = sz;
		size = 0;
		listArray = new Object[sz];
	}
	
	public void insert(int i,Object obj) throws Exception{		
		if (size == maxSize){
		 	throw new Exception("顺序表已满无法插入！");
		}
		if (i > size){
			throw new Exception("参数错误！");
		}
				
		for(int j = size; j > i; j--){
			listArray[j] = listArray[j-1];
		}
		
		listArray[i] = obj;
		size++; 
	}
	
	public Object delete(int i) throws Exception{		
		if(size == 0){
			throw new Exception("顺序表已空无法删除！");
		}
		if (i > size-1){
			throw new Exception("参数错误！");
		}
		Object it = listArray[i];
		for(int j = i; j < size-1; j++){
			listArray[j] = listArray[j+1]; 
		}
			
		size--;
		return it;	
	}
	
	public Object getData(int i) throws Exception{		
		if(i < 0 || i >= size){
			throw new Exception("参数错误！");
		}
		return listArray[i];
	}
	
	public int size(){
		return size;
	}
	
	public boolean isEmpty(){
		return size == 0;
	}
	
	public int MoreDataDelete(SeqList L, Object x) throws Exception{
		
		int i, j;
		int tag = 0;
		
		for(i = 0; i < L.size; i++){
			if(x.equals(L.getData(i))){
				L.delete(i);
				i --;
				tag = 1;
			}
		}
		
		return tag;
	}	
}