# 1480. Running Sum of 1d Array
Difficulty: Easy

## Solution

/**
*** Author: R-CO
*** E-mail: [e-mail]
*** Date: 2020-10-21
**/
#include <cstdlib>
#include <vector>
using std::vector;

class Solution {
 public:
  vector<int> runningSum(vector<int>& nums) {
    const auto kNumsSize = nums.size();
    for (size_t i = 1; i < kNumsSize; ++i) {
      nums[i] = nums[i] + nums[i - 1];
    }

    return nums;
  }
};

int main(int argc, char* argv[]) { return EXIT_SUCCESS; }

## Result

Success
Details
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Running Sum of 1d Array.
Memory Usage: 8.9 MB, less than 96.62% of C++ online submissions for Running Sum of 1d Array.

###### tags: `LeetCode-Easy` `C++`