From c42e5fa30d48b50c03ad95fcb137b1a5e06aa4e8 Mon Sep 17 00:00:00 2001
From: Jidong Xiao <xiaoj8@rpi.edu>
Date: Mon, 18 Sep 2023 22:46:03 -0400
Subject: [PATCH] adding leetcode solution

---
 leetcode/p1480_runningsumofarray.cpp | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 leetcode/p1480_runningsumofarray.cpp

diff --git a/leetcode/p1480_runningsumofarray.cpp b/leetcode/p1480_runningsumofarray.cpp
new file mode 100644
index 0000000..d1440e5
--- /dev/null
+++ b/leetcode/p1480_runningsumofarray.cpp
@@ -0,0 +1,23 @@
+class Solution {
+public:
+    vector<int> runningSum(vector<int>& nums) {
+        int sum=0;
+        vector<int> result;
+        int size = nums.size();
+        // because runningSum will have size elements, and runningSum[0] is the sum of one element, i.e., nums[0]. 
+        for(int i=1;i<(size+1);i++){
+            int *a = new int[i];
+            // sum stores the sum from nums[0] to nums[i]
+            for(int j=0;j<i;j++){
+                a[j] = nums[j];
+                sum = sum + a[j];
+            }
+            result.push_back(sum);
+            // allocated memory for an array, and thus delete memory for an array
+            delete [] a;
+            // reset sum so as to reuse it.
+            sum = 0;
+        }
+        return result;
+    }
+};