线性表(四)
return i;
else
return -1;
}
@Override
public void insert(int i, Object e) {
DlNode p = index(i);
DlNode p2 = new DlNode(e);
p2.next = p.next;
p2.prior = p;
p.next = p2;
size ++;
}
@Override
public boolean isEmpty() {
if(size ==0)
return true;
else
return false;
}
@Override
public int lastIndexOf(Object e) {
DlNode p = head.prior;
int i = size-1;
while(!p.data.equals(e)) {
p = p.prior;
i--;
}
if(i>=0)
return i;
else
return -1;
}
@Override
public void remove(int i) {
if(i>=0 && i
DlNode p = null;
if(i == 0)
p = head;
else {
p = index(i-1);
}
DlNode p2 = index(i).next;
p.next = p2.next;
p2.next.prior = p;
}
size --;
}
@Override
public void set(int i, Object e) {
DlNode p = index(i);
p.data = e;
}
@Override
public int size() {
return size;
}
}