Running Sum of 1d Array.

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

LeetCode Problem: Link | Click Here

class Solution {
    public int[] runningSum(int[] nums) {
        // Get the length of the input array
        int numsLength = nums.length;

        // Create an array to store the running sum values
        int[] runningSum = new int[numsLength];

        // Initialize the first element of the runningSum array with the first element of nums array
        runningSum[0] = nums[0];

        // Initialize a temporary variable to keep track of the running sum
        int temp = nums[0];

        // Iterate through the nums array starting from the second element
        for (int i = 1; i < numsLength; i++) {
            // Calculate the running sum for each index i
            // Add the previous running sum (temp) with the current value in nums array
            runningSum[i] = temp + nums[i];

            // Update the temporary variable to store the current running sum for the next iteration
            temp = runningSum[i];
        }

        // Return the array containing the running sum values
        return runningSum;
    }
}