實現簡單的鏈接列表

Question

嗨我希望實現一個簡單的鏈表和所有的值到列表的末尾。雖然這麼簡單，但我無法做到這一點。你能告訴我我在哪裏做錯了嗎？最初我正在聲明一個指針併爲其分配NULL值。後來在每次迭代中，我都將內存分配給最初爲NULL的指針。

#include <stdio.h> 
#include <malloc.h> 

struct node{ 
    int a; 
    struct node* next; 
}; 
struct node* insert(struct node* start,int value); 
void print(struct node* head); 
int main() 
{ 
    int a; 
    struct node* head = NULL; 
    while(scanf("%d",&a) != EOF)//taking input 
    { 
     head = insert(head,a); 
     print(head); 
    } 
    return 0; 
} 

struct node* insert(struct node* start,int value) 
{ 
    struct node* head = start; 
    while(start != NULL) 
    { 
     start = start->next;//getting upto the end of the linked list 
    } 
    start = (struct node*)malloc(sizeof(struct node));//allocating memory at the end 
    start->a = value; 
    start->next = NULL; 
    if(head == NULL) 
    { 
     return start;//for the base case when list is initally empty 
    } 
    return head; 
} 

void print(struct node* head) 
{ 
    while(head != NULL) 
    { 
     printf("%d\n",head->a); 
     head = head->next; 
    } 
    return; 
} 

Answer 1

你失去你的尾巴和你的新節點之間的聯動，試試這個，而不是

struct node* insert(struct node* head,int value) 
{ 
struct node* tail = head; 
while(tail != NULL && tail->next != NULL) 
{ 
    tail= tail->next;//getting upto the end of the linked list 
} 

struct node* start = (struct node*)malloc(sizeof(struct node));//allocating memory at the end 
start->a = value; 
start->next = NULL; 
if(head == NULL) 
{ 
    return start;//for the base case when list is initally empty 
} 
else 
{ 
    tail->next = start; 
} 
return head; 
} 

Answer 2

struct node* insert(struct node* start,int value){ 
    struct node* head = start; 
    struct node* np = (struct node*)malloc(sizeof(struct node)); 
    np->a = value; 
    np->next = NULL; 

    if(head == NULL) 
     return np; 

    while(start->next != NULL){ 
     start = start->next; 
    } 
    start->next = np; 
    return head; 
} 

---

是什麼讓我使用越野車的辦法？

nodeX 
| 
+a 
| 
+next(address to OtherX) 

nodeX.next = new_node;//update link(case of OK) 

tempPointer = nodeX.next;//address to OtherX set to tempPointer 
tempPointer = new_node;//contents of tempPointer changed, but orignal (nodeX.next not change)