题目来源于力扣——1480. 一维数组的动态和 - 力扣(LeetCode) (leetcode-cn.com)
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* runningSum(int* nums, int numsSize, int* returnSize){
for (int i = 1; i < numsSize; i++) {
nums[i] += nums[i - 1];
}
return nums;
}