1480. Running Sum of 1d Array

最新推荐文章于 2022-06-30 15:15:57 发布

Yonas-Luo

最新推荐文章于 2022-06-30 15:15:57 发布

阅读量853

点赞数

文章标签： C Leetcode

本文链接：https://blog.csdn.net/qq_17351161/article/details/106904788

版权

1480. Running Sum of 1d Array

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* runningSum(int* nums, int numsSize, int* returnSize)
{
    int* outputNums = (int*)malloc(sizeof(int)*numsSize);                   
    outputNums[0] = nums[0];

    for(int i=1; i<numsSize; i++)
    {
        outputNums[i] = outputNums[i-1] + nums[i];
    }

    *returnSize = numsSize;
    return outputNums;
}