c语言链表

[Zia leung]

#include<stdio.h> #include<stdlib.h> #define LEN sizeof(struct Node) int n; struct Node { int x; struct Node *next; }; void main() { struct Node *CreateLList(); struct Node *SortLList(struct Node *head); void PrintLList(struct Node *head); struct Node *h1,*h2; h1=CreateLList();PrintLList(h1); h2=CreateLList();PrintLList(h2); } void PrintLList(struct Node *head) { struct Node *p; p=head; printf("the new records are:\n"); if(head!=NULL) do { printf("%d ",p->x); p=p->next; } while(p->next!=NULL); } struct Node *CreateLList() { struct Node *head,*p; n=0; head=p=(struct Node*)malloc(LEN); scanf("%d",&p->x); head=NULL; while(p->x!=0) { ++n; if(n==1) {head=p; head->next=NULL;} else { p->next=head->next; head->next=p; p=(struct Node*)malloc(LEN); scanf("%d",&p->x); } } return head; } 为什么链表无限循环下去了，哪位大佬帮我解决一下bug。

[哪块小饼干鸭]

循环条件不太对叭……

[自信男孩]

#include<stdio.h>
#include<stdlib.h>

#define LEN sizeof(struct Node)
//int n;

struct Node
{
    int x;
    struct Node *next;
};

struct Node *CreateLList();
struct Node *SortLList(struct Node *head);
void PrintLList(struct Node *head);
//void main()
int main()
{
    struct Node *h1,*h2;
    h1=CreateLList();
    PrintLList(h1);
    h2=CreateLList();
    PrintLList(h2);
}

void PrintLList(struct Node *head)
{
    struct Node *p;
    p = head;
    printf("the new records are:\n");
    //if(head!=NULL)
    if(!head)
        return;
    do {
        printf("%d ", p->x);
        p = p->next;
        //} while(p->next!=NULL);
    } while(p!=NULL);
    putchar(10);
}

struct Node *CreateLList()
{
    struct Node *head,*p;
    int n=0;
    head = p = (struct Node*)malloc(LEN);
    if (!p)
        exit(0);
    scanf("%d", &p->x);
    //head=NULL;
    while(p->x != 0)
    {
        ++n;
        if(n==1)
        {
            head = p;
            head->next = NULL;
        }
        else
        {
            p->next = head->next;
            head->next = p;
        }
        p = (struct Node*)malloc(LEN);
        if (!p)
            exit(0);
        scanf("%d", &p->x);
    }
    free(p);

    return head;
}

供参考～

[自信男孩]

建议楼主对比代码找出自己逻辑上问题～

[Donald_Shallwing]

建议简单的链表用递归的方法建立和遍历： https://gitee.com/shallwing/C-3P/blob/master/DataStructure-OS/DataStructure/linearList/list.cpp