测试结果：
注：代码开源到我的Github：https://github.com/mmc-maodun/CareerCup/tree/master
[CareerCup] Linked Lists―Q2.4(二)
PNODE)malloc(sizeof(NODE)); if(!pNew) { printf(malloc failed ); exit(-1); } pNew->pNext = NULL; pNew->data = 1; p1->pNext->pNext = pNew; } } else //两链表长度相同，且组后一位有进位 { PNODE pNew = (PNODE)malloc(sizeof(NODE)); if(!pNew) { printf(malloc failed ); exit(-1); } pNew->pNext = NULL; pNew->data = 1; p1->pNext = pNew; } } p1 = p1->pNext; p2 = p2->pNext; } }
测试结果：
测试结果：