int listinsert(linklist &l, int i, int e){ //typedef node * linklist
p = l;
j = 0;
while (p && j < i - 1){
p = p -> next;
j++;
}
if (!p || i <= 0){
return error;
}
s = new node();
s -> data = e;
s -> next = p -> next;
p -> next = s;
return ok;
}
单链表--在第i个位置前插入元素e
最新推荐文章于 2023-10-12 09:50:01 发布