LeetCode Çözümlerİ – 1480. Running Sum Of 1D Array

LeetCode içerisinde bulunan “Running Sum Of 1D Array”‘ sorusunun açıklaması ve çözümü. Bu soruda tek boyutlu bir dizide her bir eleman için, o elemana olan kadar gelen elemanların toplamını yazdırmanız istenmekte.

🔥 LeetCode 1480. Running Sum Of 1D Array: https://leetcode.com/problems/running-sum-of-1d-array/

➡️ Problem açıklaması:

Given 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.

Example 1:

Input: nums = [1,2,3,4]

Output: [1,3,6,10]

Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].

Example 2:

Input: nums = [1,1,1,1,1]

Output: [1,2,3,4,5]

Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].

Example 3:

Input: nums = [3,1,2,10,1]

Output: [3,4,6,16,17]

Constraints:

1 <= nums.length <=1000

-10^6 <= nums[i] <= 10^6

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.