g1401_1500.s1480_running_sum_of_1d_array.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1401_1500.s1480_running_sum_of_1d_array;

// #Easy #Array #Prefix_Sum #Level_1_Day_1_Prefix_Sum
// #2022_04_04_Time_0_ms_(100.00%)_Space_42.9_MB_(76.13%)

/**
 * 1480 - Running Sum of 1d Array\.
 *
 * Easy
 *
 * 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`
**/
public class Solution {
    public int[] runningSum(int[] nums) {
        int sum = 0;
        int[] result = new int[nums.length];
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            result[i] = sum;
        }
        return result;
    }
}