解题思路:
给大家一个真正用链表实现的
参考代码:
#include<iostream> #include<cstdio> #include<stdlib.h> #include<algorithm> using namespace std; struct LinkList { int fu; int zheng; LinkList *next; }; LinkList *BuildList() { LinkList *head=NULL; int zheng; int fu; int n=10; while(n--) { cin>>zheng; cin>>fu; LinkList *new_node=(LinkList *)malloc(sizeof(LinkList)); if(new_node==NULL) { cout<<"failed"<<endl; } new_node->zheng =zheng; new_node->fu=fu; LinkList *p; if(head==NULL) { head=new_node; new_node->next=NULL; p=head; } if(p!=NULL) { p->next=new_node; new_node->next=NULL; p=new_node; } } return head; } void Print(LinkList *head) { LinkList *p; p=head; int zheng=0; int fu=0; while(p) { zheng+=p->zheng; fu+=p->fu; p=p->next; } cout<<zheng<<"+"<<fu<<"i"<<endl; } int main() { LinkList *p=BuildList(); Print(p); return 0; }
0.0分
5 人评分