添加到鏈接列表的前面

Question

我能夠成功地將名稱添加到列表的末尾，但我無法將其添加到前面。 我想弄清楚如何添加到節點的前面，謝謝。 我以爲我明白，要加到後面，你用最後一個屁股變量的代碼將cout，所以我試圖操縱，並使用頭開始在開始。

#include <iostream> 
#include <string> 

using namespace std; 

struct node 
{ 
    string name; 
    string name1; 
    node *next; 

}; 

bool isEmpty(node *head); 
char menu(); 
void insert(node *&head, node *&last, string name); 
void insert_front(node *&head, node*&start, string name1); 
void insert_back(node *&head, node *&last, string name); 

void print(node *current); 
bool isEmpty(node *head) 
{ 
    if (head == NULL) 
     return true; 
    else 
     return false; 
} 


char menu() 
{ 
    char choice; 
    cout << "Menu\n"; 
    cout << "1. Add a name to the front of the list." << endl; 
    cout << "2. Add a name to the back of the list." << endl; 
    cout << "3. Print the list." << endl; 
    cout << "4. Exit." << endl; 
    cin >> choice; 
    return choice; 
} 

void insert(node *&head, node *&last, string name) 
{ 
    node *temp = new node; 
    temp->name = name; 
    temp->next = NULL; 
    head = temp; 
    last = temp; 
} 

void insert_back(node *&head, node *&last, string name) 
{ 
    if (isEmpty(head)) 
     insert(head, last, name); 
    else 
    { 
     node *temp = new node; 
     temp->name = name; 
     temp->next = NULL; 
     last->next = temp; 
     last = temp; 
    } 
} 

void insert_front(node *&head, node *& start, string name1) 
{ 
    node *temp = new node; 
    temp->name1 = name1; 
    temp->next = head; 
    head = temp; 
} 
void print(node *current) 
{ 
    if (isEmpty(current)) 
     cout << "The list is emtpy." << endl; 
    else 
    { 
     cout << "List of names: \n"; 
     while (current != NULL) 
     { 
      cout << current->name << endl; 
      current = current->next; 
     } 
    } 

} 

int main() 
{ 
    node *head = NULL; 
    node *last = NULL; 
    node *start = NULL; 
    char choice; 
    string name, name1; 
    do 
    { 
     choice = menu(); 
     switch (choice) 
     { 
     case '1': 
      cout << "Enter first name to the front of the list: " << endl; 
      cin >> name1; 
      insert_front(head, start, name1); 
      break; 
     case '2': 
      cout << "Enter first name to the end of the list:" << endl; 
      cin >> name; 
      insert_back(head, last, name); 
      break; 
     case '3': print(head); 
      break; 
     case '4': 
      return 0; 
      break; 
     } 
    } while (choice != 4); 

} 

Answer 1

你有很多不相干的「東西」混入代碼插入列表頭。你的insert_front顯然沒有錯;如果有問題，最有可能在其他地方。

我會縮小代碼的範圍，使其他大多數問題都被刪除。我還用ctor正確初始化一個節點，讓這個順序碼的東西：

#include <iostream> 

class linked_list { 

    struct node { 
     int value; 
     node *next; 

     node(int value, node *next) : value(value), next(next) {} 

     friend std::ostream &operator<<(std::ostream &os, node const &n) { 
      return os << n.value; 
     } 
    } *head = nullptr; 

public: 

    void add_front(int i) { 
     head = new node(i, head); 
    } 

    friend std::ostream &operator<<(std::ostream &os, linked_list const &ll) { 
     for (node *n = ll.head; n != nullptr; n = n->next) 
      os << *n << ' '; 
     return os; 
    } 

}; 

int main() { 
    linked_list data; 

    data.add_front(1); 
    data.add_front(2); 
    data.add_front(5); 
    std::cout << data; 
} 

Answer 2

我已經斬了你的代碼到一個最小工作集，請研究並改寫必要。請注意列表，注意當你想改變在main中定義的頭或尾值時，你必須傳遞本身是指針的變量的地址。

#include <iostream> 
#include <string> 

using namespace std; 

struct node { 
    string name; 
    node* next; 
}; 

char menu() { 
    char choice; 
    cout << "Menu\n"; 
    cout << "1. Add a name to the front of the list." << endl; 
    cout << "3. Print the list." << endl; 
    cout << "4. Exit." << endl; 
    cin >> choice; 
    return choice; 
} 

bool isEmpty(node* current) { 
    return current == NULL; 
} 

void insert_front(node** head, string name) { 
    node* temp = new node; 
    temp->name = name; 
    temp->next = *head; 
    *head = temp; 
} 

void print(node* root) { 
    if (isEmpty(root)) 
     cout << "The list is emtpy." << endl; 
    else { 
     cout << "List of names: \n"; 
     node* current = root; 
     while (current != NULL) { 
      cout << current->name << endl; 
      current = current->next; 
     } 
    } 
} 

int main() { 
    node* head = NULL; 
    node* last = NULL; 
    char choice; 
    string name; 

    do { 
     choice = menu(); 
     switch (choice) { 
     case '1': 
      cout << "Enter first name to the front of the list: " << endl; 
      cin >> name; 
      insert_front(&head, name); 
      break; 
     case '3': print(head); 
      break; 
     case '4': 
      return 0; 
      break; 
     } 
    } while (choice != 4); 
}