编辑代码

class Main {
	public static void main(String[] args) {
        //JSRUN引擎2.0，支持多达30种语言在线运行，全仿真在线交互输入输出。

        sequenceList seq =new sequenceList(10);
        seq.add(23,1);
        seq.add(34,2);
        seq.find(23);
        seq.nextOrder();
		System.out.println(seq.find(33434));
	}
}
class Book{
    public String name;
    public String Sn;
}
class sequenceList<T>{
    final int defaultSize = 10;
    private T[]listArray;
    private int length;
    public sequenceList(){}
    public sequenceList(int n){
        if(n<=0){
            System.out.println("error");
            System.exit(1);
        }
        length=0;
        listArray=(T[])new Object[n];
    }
    public boolean add(T obj,int pos){
        if(pos<1||pos>length+1){
            System.out.println("pos值不合法");
            retuen false;
        }
        if(length==listArray.length){
            T[]p=(T[])new Object[length*2];
            for(int i=0;i<length;i++)
            p[i]=listArray[i];
            listArray=p;
        }
        for(int i=length;i>=pos;i--)
        listArray[i]=listArray[i-1];
        listArray[pos-1]obj;
        length++;
        retuen ture;
    }
    public T  remove(int pos){
        T x=listArray[pos-1];
        for(int i=pos;i<=length;i++)
        listArray[i-1]=listArray[i];
        length--;
        return x;
    }
    public int find(T obj){
        if(isEmpty()){
            System.out.println("顺序表为空");
            return-1;
        }
        else{
            for(int i=0;i<length;i++)
            if(listArray[i].equals(obj))
            return i+1;
            return -1;
        }
    }
    public T value(int pos){
           if(isEmpty( )){
		        System.out.println("顺序表为空");
		        return null;
	        }
	        else{
	                if(pos<1||pos>length){
                        System.out.println("pos值不合法");
		                return null;
	                }
		            return listArray[pos-1];		
	        }    	 
    }
    public boolean modify(T obj,int pos){
        if(isEmpty( )){
		    System.out.println("顺序表为空");
		    return false;
	    }
    	else{
    		    if(pos<1||pos>length){
        			System.out.println("error");
        			return false;
        	    }
        	listArray[pos-1]=obj;   	
            return true;  	
    	}    	
    }
    public boolean isEmpty(){    
        	return length==0;
    }          
    public int size(){    
        return length;
    }

    public void nextOrder(){
    	for(int i=0;i<length;i++)
    		System.out.println(listArray[i]);
    }

}