用VS来写链表求和

解题思路:

注意事项:

参考代码:

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>

#include <malloc.h>

typedef struct _node

{

int i;

int j;

struct _node* next;

}NODE;

NODE* add(NODE* head, int i, int j);

NODE addition(NODE* head);//创建节点

int main()

{

int i = 0;

int j = 0;

int cnt = 0;

NODE* head = NULL;

do

{

scanf("%d%d", &i, &j);

head = add(head, i, j);

} while ((++cnt) <= 9);

NODE p = addition(head);

printf("%d+%di", p.i, p.j);

}

NODE addition(NODE* head)//加法

{

NODE* move = head;

int real = 0;

int virt = 0;

int cnt = 0;

do

{

real += move->i;

virt += move->j;

move = move->next;

} while ((++cnt) <= 9);

NODE p;

p.i = real;

p.j = virt;

p.next = NULL;

return p;

}

NODE* add(NODE* head, int i, int j)

{

NODE* p = (NODE*)malloc(sizeof(NODE));

p->i = i;

p->j = j;

NODE* last = head;

if (last)

{

while (last->next)

{

last = last->next;

}

last->next = p;

}

else

{

head = p;

}

return head;

}