JAVA 续数据结构

import java.util.Scanner;
public class SeqList implements List{
Scanner input = new Scanner(System.in);
public int size = 0;
double[] ListArray;

public void SeqList(){
	System.out.println("请输入数组元素个数：");
	size = input.nextInt();
	ListArray = new double[size];
	System.out.println("请输入" + (size-1) + "个元素:");
	for(int i = 0;i<ListArray.length-1;i++)
		ListArray[i] = input.nextDouble();
}

public void SeqListTraverse(){
	System.out.println("遍历输入的数组：");
	for(int i = 0;i<ListArray.length-1;i++){
		System.out.print(ListArray[i] + " ");
	}
}
			
public void insert(int i,double obj){
	for(int j = size-2;j>=i;j--){
		ListArray[j+1] = ListArray[j];
	}
	ListArray[i] = obj;
	size++;
}

public void backSeqListTraverse(){
	System.out.println("遍历插入后的数组：");
	for(int i = 0;i<ListArray.length;i++){
		System.out.print(ListArray[i] + " ");
	}		
}

public double delete(int i){
	double it = ListArray[i-1];
	for(int j = i-1;j<size-2;j++){
		ListArray[j] = ListArray[j+1];
	}
	return it;
}

public void traverseDeleteDackSeqList(){
	System.out.println("遍历删除后的数组：");
	for(int i = 0;i<ListArray.length-1;i++){
		System.out.print(ListArray[i] + " ");
	}		
}

public double getData(int i){
	if(i<0||i>=ListArray.length){
		System.out.println("下标位置不合法！");
	}
	return ListArray[i];
}

public int size(){
	return ListArray.length;
}

public boolean isEmpty(){
	return size() == 0;
}

//该功能仍需改进
public int moreDataDelete(SeqList s,int deleteDataSite){
int i = 0;
int tag = 0;
for(i = 0;i<s.size();i++){
if(ListArray[i]==ListArray[deleteDataSite]){
s.delete(deleteDataSite);
tag = 1;
}
}
System.out.println(“输出删除之后的元素：”);
for(i = 0;i<s.size();i++){
System.out.print(ListArray[i] + " ");
}
return tag;
}