[codewars][C++]Sum of a sequence

sjtubn

于 2019-02-22 15:44:27 发布

阅读量322

点赞数

分类专栏： codewars C++

本文链接：https://blog.youkuaiyun.com/sjtubn/article/details/87879796

版权

codewars 同时被 2 个专栏收录

8 篇文章

订阅专栏

C++

4 篇文章

订阅专栏

本文介绍了一种用于求解特定序列之和的算法。该序列由三个非负整数定义：开始值、结束值和步长。算法通过迭代计算从开始值到结束值之间的所有整数之和，步长决定序列的递增方式。文章提供了详细的代码实现，并讨论了正负步长对求和结果的影响。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Your task is to make function, which returns the sum of a sequence of integers.

The sequence is defined by 3 non-negative values: begin, end, step.

If begin value is greater than the end, function should returns 0

Examples

sequenceSum (2,2,2); // => 2
sequenceSum (2,6,2); // => 12 -> 2 + 4 + 6
sequenceSum (1,5,1); // => 15 -> 1 + 2 + 3 + 4 + 5
sequenceSum (1,5,3); // => 5 -> 1 + 4

思路：这里除了遍历之外，只需要考虑step正负的情况即可

代码如下：

long long int sequence_sum(long long int begin_number, long long int end_number, long long step){
//your code here
long long int sum = 0;
for (long long int i = begin_number; step > 0 ? i <= end_number : i >= end_number; i += step)
sum += i;
return sum;
}