标题:请各位大神帮帮忙,编译器提示的错误为 `main' undeclared (first use this ...
只看楼主
孤单忧怜
Rank: 1
等 级:新手上路
帖 子:5
专家分:7
注 册:2015-3-9
结帖率:0
已结贴  问题点数:20 回复次数:1 
请各位大神帮帮忙,编译器提示的错误为 `main' undeclared (first use this function) 和让在主函数main()直接加;
#include "stdlib.h"
#include "stdio.h"
typedef int ElemType;
typedef struct node{
        ElemType data;
        struct node *next;
        }LNode,*LinkList;
LinkList CreatLinkList(int n){
         /*建立一个长度为n的链表*/
         LinkList p,r,list=NULL;
         ElemType e;
         int i;
         for(i=1;i<=n;i++)
         {
                          scanf("%d ",&e);
                          p=(LinkList)malloc(sizeof(LNode));
                          p->data=e;
                          p->next=NULL;
                          if(!list)
                          list=p;
                          else
                          r->next=p;
                          r=p;
                          }
                          return list;
         }
void insertList(LinkList *list,LinkList q,ElemType e){
     LinkList p;
     p=(LinkList)malloc(sizeof(LNode));
     p->data=e;
     if(!*list){
                *list=p;
                p->next=NULL;
                }
                else{
                     p->next=q->next;
                     q->next=p;
                     }
                     }
                     void delLink(LinkList *list,LinkList q){
                          LinkList r;
                          if(q==*list){
                          *list=q->next;
                          free(q);
                          }
                          else{
                               for(r=*list;r->next!=q;r=r->next){
                               if(r->next!=NULL){
                                                 r->next=q->next;
                                                 free(q);
                                                 }
                               }
                               }
void destoryLinkList(LinkList *list);
{
                                    LinkList p,q;
                                    p=*list;
                                    while(p){
                                             q=p->next;
                                             free(p);
                                             p=q;
                                             }
                                             *list=NULL;
                                             }
 main(){
      int e,i;
      LinkList l,p;
      q=l=CreatLinkList(l);
      scanf("%d",&e);
      while(e)
      {
              insertList(&l,q,e);
              q=q->next;
              scanf("%d",&e);
              }
              q=1;
              printf("The content of the linklist\n" );
              q=q-next;
              while(q){
              printf("%d ",q->data);
              q=q->next;
              }
              q=1;
              printf("\nDelete the fifth element\n");
              for(i=0;i<4;i++)
              {
                              q=q->next;
              }
              delLink(&l,q);
              q=l;
              while(q)
              {
                      printf("%d ",q->data);
                      q=q->next;
              }
              destoryLinkList(&l);
              getche();
              }
              }
搜索更多相关主题的帖子: function include 编译器 
2015-03-16 20:41
azzbcc
Rank: 19Rank: 19Rank: 19Rank: 19Rank: 19Rank: 19
来 自:江西财经大学
等 级:贵宾
威 望:81
帖 子:3293
专家分:12919
注 册:2012-11-4
得分:20 
论对齐的重要性

程序代码:
#include "stdlib.h"
#include "stdio.h"
typedef int ElemType;
typedef struct node{
    ElemType data;
    struct node *next;
}LNode,*LinkList;
LinkList CreatLinkList(int n){
    /*建立一个长度为n的链表*/
    LinkList p,r,list=NULL;
    ElemType e;
    int i;
    for(i=1;i<=n;i++)
    {
        scanf("%d ",&e); 
        p=(LinkList)malloc(sizeof(LNode));
        p->data=e;
        p->next=NULL;
        if(!list)
            list=p;
        else
            r->next=p;
        r=p;
    }
    return list;
}
void insertList(LinkList *list,LinkList q,ElemType e){
    LinkList p;
    p=(LinkList)malloc(sizeof(LNode));
    p->data=e;
    if(!*list){
        *list=p;
        p->next=NULL;
    }
    else{
        p->next=q->next;
        q->next=p;
    }
}
void delLink(LinkList *list,LinkList q){
    LinkList r;
    if(q==*list){
        *list=q->next;
        free(q);
    }
    else{
        for(r=*list;r->next!=q;r=r->next){
            if(r->next!=NULL){
                r->next=q->next;
                free(q);
            }
        }
    }
    void destoryLinkList(LinkList *list);
    {
        LinkList p,q;
        p=*list;
        while(p){
            q=p->next;
            free(p);
            p=q;
        }
        *list=NULL;
    }
    main(){
        int e,i;
        LinkList l,p;
        q=l=CreatLinkList(l);
        scanf("%d",&e);
        while(e)
        {
            insertList(&l,q,e);
            q=q->next;
            scanf("%d",&e);
        }
        q=1;
        printf("The content of the linklist\n" );
        q=q-next;
        while(q){
            printf("%d ",q->data);
            q=q->next;
        }
        q=1;
        printf("\nDelete the fifth element\n");
        for(i=0;i<4;i++)
        {
            q=q->next;
        }
        delLink(&l,q);
        q=l;
        while(q)
        {
            printf("%d ",q->data);
            q=q->next;
        }
        destoryLinkList(&l);
        getche();
    }
}


[fly]存在即是合理[/fly]
2015-03-17 09:18



参与讨论请移步原网站贴子:https://bbs.bccn.net/thread-442712-1-1.html




关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.531120 second(s), 8 queries.
Copyright©2004-2024, BCCN.NET, All Rights Reserved