if(!head){ // 空表插入 head = tempNew; }elseif(value <= head -> val){ //插入头部 tempNew->next = head; head = tempNew; }else{ //在中间插入 Node* p = head; while(p -> next != NULL && value > p->next->value){ p = p -> next; } tempNew->next = p -> next; p -> next = tempNew; }
4.2. 删除
1 2 3 4 5 6 7 8 9 10 11
if( value == head->value){ head = head->next; delete cur; }else{ while(cur -> next != NULL && cur -> next -> value != value){ cur = cur -> next; } Node* needDel = cur -> next; cur -> next = needDel -> next; delete needDel; }
评论