6-182 Sum of the nodes of a Singly Linked List with dummy header

实现一个函数,计算带有哑节点的单链表中所有节点的值之和。遍历每个节点,将值累加到总和中。例如,链表Dummy Header -> 2 -> 27 -> 32 -> 1 -> 5的节点和为67。
摘要由CSDN通过智能技术生成

In this problem you will implement a function for a singly-linked list for geting the sum of the nodes.

Format of functions:

ElementType getSum(List L);

The parameter L is a pointer to the dummy header. The function return the sum of the nodes of a Singly Linked List with dummy header.

where List is defined as the following:

typedef int ElementType; 
struct Node 
{ 
        ElementType data; 
        struct Node* next; 
}; 
typedef struct Node* PtrToNode; 
typedef PtrToNode List;


A singly linked list is a data structure in which an element has two parts one is the value and other is the link to the next element. So to find the sum of all elements of the singly linked list, we have to navigate to each node of the linked list and add the element's value to a sum variable.

For example</

  • 12
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值