public class Circle{
int count = 0;
Child first;
Child last;
Circle(int n){
for(int i=0; i<n; i++){
Add();
}
}
void Add(){
Child c = new Child();
c.id = count;
if(count == 0){
first = last = c;
}
else {
c.left = last;
c.right = first;
last.right = c;
first.left = c;
last=c;
}
count++;
}
void Delete(Child c){
if(count<1){
return;
}
else if(count ==1){
first = last = null;
}
else{
c.left.right = c.right;
c.right.left = c.left;
if(c==first){
first = c.right;
}
if(c==last){
last = c.left;
}
}
count--;
}
}
对像实现数3退1
最新推荐文章于 2022-02-23 15:02:25 发布