LeetCode #1480 - Running Sum of 1d Array\nGiven an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums.\n### Example\n#### Input\nnums = [1,2,3,4]\n#### Output\n[1,3,6,10]\n### Constraints\n1 <= nums.length <= 1000\n-10^6 <= nums[i] <= 10^6