從鏈接列表中搜索並刪除一個節點

Question

我正在使用鏈接列表編寫一個簡單的字典程序。我想搜索詞典中的一個詞並刪除它。我已經編寫了代碼，但我認爲這是更耗時間的，因爲我運行循環兩次，第一次搜索節點並記下位置，第二次刪除它。

struct node{ 
    char word[20]; 
    char meaning[5][100]; 
    struct node *next; 
}; 

void del(struct node *head, char *word) 
{ 
    int found = 0, position = 0, i; 
    struct node *temp = head; 
    while(temp != NULL) 
    { 
    if(strcmp(temp->word, word) == 0) 
    { 
     found = 1; 
     break; 
    } 
    temp = temp->next; 
    position++; 
    } 
    if(found == 1) 
    { 
     temp = head; 
     if(position == 0) 
     { 
      head = temp->next; 
      free(temp); 
     } 
     for(i = 0; i < position-1; i++) 
      temp = temp->next; 
     struct node *temp2 = temp->next; 
     temp->next = temp2->next; 
     free(temp2); 
     printf("Word deleted..\n"); 
    } 
    else printf("Word not found!\n"); 
} 

是否有任何替代方法來優化程序？

Answer 1

你只需要像這樣合併兩個週期，下面是一個代碼示例。

struct node{ 
    char word[20]; 
    char meaning[5][100]; 
    struct node *next; 
}; 

struct node *del(struct node *head, char *word) 
{int found = 0, position = 0, i; 
    struct node *temp = head; 
    struct node *prev = NULL; 
    /*You should avoid breaks because they decrease legibility*/ 
    while(temp != NULL) 
    { 

    if(strcmp(temp->word, word) == 0) 
    { 
     if(prev == NULL){ /*If the node is the head*/ 
      head = head->next; 
      free(temp); 
      return head; 
     }else{ 
      prev->next = temp->next; 
      free(temp); 
      return head; 
     } 
    } 
    prev = temp; 
    temp = temp->next; 
    } 

}