链表练习-10数求和

#include<stdio.h>  
#include <stdlib.h>  
  
int add(int a, int b) {  
    return (a+b);  
}  
  
typedef struct record {    
    int rec_num;    
    int value;    
    struct record *next;    
} point;  
  
int main() {  
    int a[10];   
    int i=0;  
    int ret=0;  
    point *point_node = NULL;  
    point *temp = NULL;    

    printf("please input 10 number\n");  
    for(i=0; i<10; i++) {    
        scanf("%d",&a[i]);  
        printf("10 number is %d\n", a[i]);  
    }  
  
    for(i=0; i<10; i++) {    
        point *new_node = (point *)malloc(sizeof(point)); // 为新节点分配内存    
        if (temp == NULL) {    
            temp = new_node;   
            point_node = temp;  
        } else {    
            // 将新节点链接到链表的末尾    
            temp->next = new_node;    
            temp = temp->next;  // 将temp指向新节点    
        }    
        new_node->rec_num = i+1;    
        new_node->value = a[i];    
        printf("ponit%d is %d\n", i, new_node->value);   
    }  
  
    while (point_node!=NULL) {    
        ret = add(ret,point_node->value);    
        point_node = point_node->next;  
    }  
	printf("add=%d\n", ret); 
    printf("hello world\n"); // 这个printf语句只执行了一次  
    return 0;  

}