第七天算法设计

线性表_顺序表的基本实现
SequenceList类：
package suanfa;

public class SequenceList {
private T[] eles;
private int N;
public SequenceList(int capacity){
this.eles = (T[])new Object[capacity];
this.N=0;
}
public void clear(){
this.N=0;
}
public boolean isEmpty(){
return N==0;
}
public int length(){
return N;
}
public T get(int i){
return eles[i];
}
public void insert(T t){
eles[N++]=t;
}
public void insert(int i,T t){
for(int index=N-1;index>i;index--){
eles[index]=eles[index-1];
}
eles[i]=t;
}
public T remove(int i){
T current = eles[i];
for(int index=i;index<N-1;index++){
eles[index]=eles[index+1];
}
N--;
return current;
}
public int indexof(T t){
for(int i=0;i<N;i++){
if(eles[i].equals(t)){
return i;
}
}
return -1;
}
}

SequenceListTest类：
package suanfa;

public class SequenceListTest {
public static void main(String[] args) {
SequenceList sl = new SequenceList<>(10);
sl.insert("yaoming");
sl.insert(1, "shenge");
String getResult =sl.get(1);
System.out.println("获取索引1出的结果为:"+getResult);
String removeResult = sl.remove(0);
System.out.println("删除的元素是："+removeResult);
sl.clear();
System.out.println("清空后的线性表中的元素个数为"+sl.length());
}
}
录制: untitled2 – SequenceListTest.java
录制文件：https://meeting.tencent.com/crm/NAGgJBXG42