user-0 提问: C语言执行的时候停止工作问题

回复:
user: user-1
content: 仅供参考：//链表实现一元多项式的加法减法乘法 #include <stdio.h> #include <stdlib.h> typedef struct node {     float coef;   //系数     int expn;     //指数     struct node *next; } PolyNode;      //多项式节点 polynomial node typedef PolyNode* Polynomial; Polynomial createPolynomial() {  //创建多项式     PolyNode *p, *q, *head = (PolyNode *)malloc(sizeof(PolyNode));   //头节点     head->next = NULL;     float coef;     int expn;     printf("输入该多项式每一项的系数和指数，每项一行，输入0 0结束！\n");     while (scanf("%f %d", &coef, &expn) && coef) {   // 默认，按指数递减排列         if (head->next) {             p = head;             while (p->next && expn < p->next->expn)                 p = p->next;             if (p->next) {                 if (expn == p->next->expn) { //有相同指数的直接把系数加到原多项式                     p->next->coef += coef;                     if (p->next->coef > -0.000001 && p->next->coef < 0.000001) { //若是相加后系数为0，则舍弃该节点                         q = p->next;                         p->next = q->next;                         free(q);                     }                 } else {                     q = (PolyNode*)malloc(sizeof(PolyNode));                     q->coef = coef;                     q->expn = expn;                     q->next = p->next;                     p->next = q;                 }             } else {                 p->next = (PolyNode*)malloc(sizeof(PolyNode));                 p = p->next;                 p->coef = coef;                 p->expn = expn;                 p->next = NULL;             }         } else {             head->next = (PolyNode*)malloc(sizeof(PolyNode));             head->next->coef = coef;             head->next->expn = expn;             head->next->next = NULL;         }     }     return head; } Polynomial multiply(Polynomial poly, float coef, int expn) {  //多项式与指定单项式相乘，该单项式为 coefx^expn     PolyNode *p, *q, *Poly = (PolyNode*)malloc(sizeof(PolyNode));     p = Poly;     q = poly->next;     while (q) {         p->next = (PolyNode*)malloc(sizeof(PolyNode));         p = p->next;         p->coef = (q->coef*coef);         p->expn = (q->expn + expn);         q = q->next;     }     p->next = NULL;     return Poly; } void add(Polynomial poly1, Polynomial poly2) {  //把 poly2 加到 poly1 上     PolyNode *p, *q, *r;     r = poly1;     p = poly1->next;  //指向第一个节点     q = poly2->next;     poly2->next = NULL;     while (p && q) {         if (p->expn > q->expn) {             r->next = p;             p = p->next;             r = r->next;         } else if (p->expn < q->expn) {             r->next = q;             q = q->next;             r = r->next;         } else {             PolyNode *t;             p->coef += q->coef;             if (!(p->coef > -0.000001 && p->coef < 0.000001)) //系数不为0             {                 r->next = p;                 r = r->next;                 p = p->next;             } else {                 t = p;                 p = p->next;                 free(t);             }             t = q;             q = q->next;             free(t);         }     }     if (p)         r->next = p;     if (q)         r->next = q; } Polynomial polySubtract(Polynomial poly1, Polynomial poly2) {  //多项式减法 poly1-poly2形成一个新的多项式     //把poly2的系数取相反数，形成一个新的多项式     Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode)); //构造头节点     PolyNode *p, *q;     p = poly;     q = poly2->next;     while (q) {         p->next = (PolyNode*)malloc(sizeof(PolyNode));         p = p->next;         p->coef = -(q->coef);  //系数取反         p->expn = q->expn;         q = q->next;     }     p->next = NULL;     add(poly, poly1);  //利用加法     return poly; } Polynomial polyAdd(Polynomial poly1, Polynomial poly2) { //多项式相加 poly1+poly2形成一个新的多项式     Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode));  //和多项式的头节点     poly->next = NULL;     PolyNode *p, *q, *r;     r = poly;     p = poly1->next;     q = poly2->next;     while (p&&q) {         if (p->expn > q->expn) {             r->next = (PolyNode*)malloc(sizeof(PolyNode));             r = r->next;             r->coef = p->coef;             r->expn = p->expn;             p = p->next;         } else if (p->expn < q->expn) {             r->next = (PolyNode*)malloc(sizeof(PolyNode));             r = r->next;             r->coef = q->coef;             r->expn = q->expn;             q = q->next;         } else {             float m = p->coef + q->coef;             if (!(m > -0.000001 && m < 0.000001)) {                 r->next = (PolyNode*)malloc(sizeof(PolyNode));                 r = r->next;                 r->coef = m;                 r->expn = p->expn;             }             q = q->next;             p = p->next;         }     }     while (p) {         r->next = (PolyNode*)malloc(sizeof(PolyNode));         r = r->next;         r->coef = p->coef;         r->expn = p->expn;         p = p->next;     }     while (q) {         r->next = (PolyNode*)malloc(sizeof(PolyNode));         r = r->next;         r->coef = q->coef;         r->expn = q->expn;         q = q->next;     }     r->next = NULL;     return poly; } Polynomial polyMultiply(Polynomial poly1, Polynomial poly2) {  //多项式相乘     Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode));  //创建多项式和的头节点     poly->next = NULL;     PolyNode *p;     p = poly2->next;     while (p) {         add(poly, multiply(poly1, p->coef, p->expn));         p = p->next;     }     return poly; } void printPoly(Polynomial poly) {  //打印多项式     if (poly && poly->next) {         PolyNode *p = poly->next;  //p指向第一个节点         while (p->next) {             printf("%gx^%d", p->coef, p->expn);             p = p->next;             if (p && (p->coef > 0))                 printf("+");         }         if (p->expn == 0)             printf("%g", p->coef);   //打印常数项         else             printf("%gx^%d", p->coef, p->expn);         printf("\n");     } } void freePoly(Polynomial poly) {  //释放内存     if (poly && poly->next) {         PolyNode *p, *q;         p = poly;         while (p) {             q = p->next;             free(p);             p = q;         }     }     poly = NULL; } int main() {     printf("用链表实现多项式的加减法\n");     Polynomial poly1, poly2, poly3;     printf("创建多项式一\n");     poly1 = createPolynomial();     printf("多项式一：\n");     printPoly(poly1);     printf("创建多项式二\n");     poly2 = createPolynomial();     printf("多项式二：\n");     printPoly(poly2);     printf("两多项式相加，和为：\n");     poly3 = polyAdd(poly1, poly2);     printPoly(poly3);     freePoly(poly3);     printf("两个多项式相乘，积为：\n");     poly3 = polyMultiply(poly1, poly2);     printPoly(poly3);     freePoly(poly3);     printf("两多项式相减，差为：\n");     poly3 = polySubtract(poly1, poly2);     printPoly(poly3);     freePoly(poly1);     freePoly(poly2);     freePoly(poly3);     system("pause");     return 0; }

user: user-2
content: #include <stdio.h> #include <stdlib.h> #include <malloc.h>  typedef struct TNode{     int data1;     int data2;     struct TNode *next; }node,*pnode;  pnode CreateList(int n); pnode ComList(pnode A,pnode B); void Dayin();  void Dayin(pnode A) {     node *p;     p = A->next;     while(p){         printf("%dx^%d\t",p->data1,p->data2);         p = p->next;     }     putchar(10); }   pnode CreateList(int n) {     int i;     node *L;     node *p;     L=(struct TNode*) malloc (sizeof(node));     L->next = NULL;     for(i = 1;i <= n;i++){         p=(struct TNode*) malloc (sizeof(node));         printf("请输入第%d的系数",n+1-i);         scanf("%d",&p->data1);         printf("请输入第%d的指数",n+1-i);         scanf("%d",&p->data2);         p->next = L->next;         L->next = p;     }     return L; } pnode ComList(pnode A,pnode B) {     int x;     node *L3;     node *rc;     node *p1;     node *p2;     node *u;     p1 = A->next;     p2 = B->next;     L3 = A;     rc = L3;     while(p1 && p2){         if(p1->data2 == p2->data2){             x= p1->data1 + p2->data1;             if(x!=0) {                 p1->data1 = x;                 rc->next = p1;                 rc = rc->next;                 p1 = p1->next;                 p2 = p2->next;             }         } else if (p1->data2 > p2->data2) {             p2 = p2->next;         } else {             p1 = p1->next;         }     }      while (p1) {         rc->next = p1;         p1 = p1->next;     }     while (p2) {         rc->next = p2;         p2 = p2->next;     }      return L3;  } int main() {     int n1,n2;     node *L1;     node *L2;     printf("请输入第一个多项式项数");     scanf("%d",&n1);     L1 = CreateList(n1);     Dayin(L1);     printf("请输入第二个多项式项数");     scanf("%d",&n2);     L2 = CreateList(n2);     Dayin(L2);     pnode L3 = ComList(L1,L2);     printf("After combine: \n");     Dayin(L3);     return 0; }  comList的逻辑有问题，详见上面的代码； 另外，建议加上对链表的释放。

user: user-0
content: 引用 3 楼 cfjtaishan 的回复:#include <stdio.h> #include <stdlib.h> #include <malloc.h>  typedef struct TNode{     int data1;     int data2;     struct TNode *next; }node,*pnode;  pnode CreateList(int n); pnode ComList(pnode A,pnode B); void Dayin();  void Dayin(pnode A) {     node *p;     p = A->next;     while(p){         printf("%dx^%d\t",p->data1,p->data2);         p = p->next;     }     putchar(10); }   pnode CreateList(int n) {     int i;     node *L;     node *p;     L=(struct TNode*) malloc (sizeof(node));     L->next = NULL;     for(i = 1;i <= n;i++){         p=(struct TNode*) malloc (sizeof(node));         printf("请输入第%d的系数",n+1-i);         scanf("%d",&p->data1);         printf("请输入第%d的指数",n+1-i);         scanf("%d",&p->data2);         p->next = L->next;         L->next = p;     }     return L; } pnode ComList(pnode A,pnode B) {     int x;     node *L3;     node *rc;     node *p1;     node *p2;     node *u;     p1 = A->next;     p2 = B->next;     L3 = A;     rc = L3;     while(p1 && p2){         if(p1->data2 == p2->data2){             x= p1->data1 + p2->data1;             if(x!=0) {                 p1->data1 = x;                 rc->next = p1;                 rc = rc->next;                 p1 = p1->next;                 p2 = p2->next;             }         } else if (p1->data2 > p2->data2) {             p2 = p2->next;//我这里改成了rc->next=p2;rc=p2;p2=p2->next         } else {             p1 = p1->next;//我这里改成了rc->next=p1;rc=p1;p1=p1->next         }     }      while (p1) {         rc->next = p1;         p1 = p1->next;[     }     while (p2) {         rc->next = p2;         p2 = p2->next;     }      return L3;  } int main() {     int n1,n2;     node *L1;     node *L2;     printf("请输入第一个多项式项数");     scanf("%d",&n1);     L1 = CreateList(n1);     Dayin(L1);     printf("请输入第二个多项式项数");     scanf("%d",&n2);     L2 = CreateList(n2);     Dayin(L2);     pnode L3 = ComList(L1,L2);     printf("After combine: \n");     Dayin(L3);     return 0; }  comList的逻辑有问题，详见上面的代码； 另外，建议加上对链表的释放。  哥，我按照你的改了一下才能正确的实现相加，，，然后，我还想问问，为什么要加ELSE 才能不出错，不加else  就报内存出错，就是我原来的代码 VS上说 0X00881731处有未经处理的异常：0XC0000005，读取位置0X0000004时发生访问冲突

user: user-2
content: 引用 5 楼 u013129143 的回复:[quote=引用 3 楼 cfjtaishan 的回复:] #include <stdio.h> #include <stdlib.h> #include <malloc.h>  typedef struct TNode{     int data1;     int data2;     struct TNode *next; }node,*pnode;  pnode CreateList(int n); pnode ComList(pnode A,pnode B); void Dayin();  void Dayin(pnode A) {     node *p;     p = A->next;     while(p){         printf("%dx^%d\t",p->data1,p->data2);         p = p->next;     }     putchar(10); }   pnode CreateList(int n) {     int i;     node *L;     node *p;     L=(struct TNode*) malloc (sizeof(node));     L->next = NULL;     for(i = 1;i <= n;i++){         p=(struct TNode*) malloc (sizeof(node));         printf("请输入第%d的系数",n+1-i);         scanf("%d",&p->data1);         printf("请输入第%d的指数",n+1-i);         scanf("%d",&p->data2);         p->next = L->next;         L->next = p;     }     return L; } pnode ComList(pnode A,pnode B) {     int x;     node *L3;     node *rc;     node *p1;     node *p2;     node *u;     p1 = A->next;     p2 = B->next;     L3 = A;     rc = L3;     while(p1 && p2){         if(p1->data2 == p2->data2){             x= p1->data1 + p2->data1;             if(x!=0) {                 p1->data1 = x;                 rc->next = p1;                 rc = rc->next;                 p1 = p1->next;                 p2 = p2->next;             }         } else if (p1->data2 > p2->data2) {             p2 = p2->next;//我这里改成了rc->next=p2;rc=p2;p2=p2->next         } else {             p1 = p1->next;//我这里改成了rc->next=p1;rc=p1;p1=p1->next         }     }      while (p1) {         rc->next = p1;         p1 = p1->next;[     }     while (p2) {         rc->next = p2;         p2 = p2->next;     }      return L3;  } int main() {     int n1,n2;     node *L1;     node *L2;     printf("请输入第一个多项式项数");     scanf("%d",&n1);     L1 = CreateList(n1);     Dayin(L1);     printf("请输入第二个多项式项数");     scanf("%d",&n2);     L2 = CreateList(n2);     Dayin(L2);     pnode L3 = ComList(L1,L2);     printf("After combine: \n");     Dayin(L3);     return 0; }  comList的逻辑有问题，详见上面的代码； 另外，建议加上对链表的释放。  哥，我按照你的改了一下才能正确的实现相加，，，然后，我还想问问，为什么要加ELSE 才能不出错，不加else  就报内存出错，就是我原来的代码 VS上说 0X00881731处有未经处理的异常：0XC0000005，读取位置0X0000004时发生访问冲突[/quote] 不只是else的问题，if中还要对p2 = p2->next做修改

user: user-3
content: p2=p2->next

user: user-1
content: 崩溃的时候在弹出的对话框按相应按钮进入调试，按Alt+7键查看Call Stack即“调用堆栈”里面从上到下列出的对应从里层到外层的函数调用历史。双击某一行可将光标定位到此次调用的源代码或汇编指令处，看不懂时双击下一行，直到能看懂为止。