int List: Remove( int i)& ∥在链表中删除第个结点 Node p=first, *a; int k=0; while(p null &&k< i-1) {p=p→link;k+;}/找第i个结点 if(p== null)& cout <<"Invalid position for Deletion! n return 0int List::Remove ( int i ) { //在链表中删除第i个结点 Node *p = first, *q; int k = 0; while ( p != NULL && k< i-1 ) { p = p→link; k++; } //找第i-1个结点 if ( p == NULL ) { cout << “Invalid position for Deletion!\n”; return 0; }