1480. Running Sum of 1d Array(leetcode)

rifat87

Tahzib Mahmud Rifat

Posted on February 20, 2024

1480. Running Sum of 1d Array(leetcode)

Image description

Introduction

Here the problem says, what we have to do is, we have to store the sum of values form 0 to running index. Like if we want is ans[3] = num[0]+num[1]+num[2]+num[3]; same goes for other index of ans.

Examples

Image description

Image description

Image description

Steps

  • ans[0] = num[0]
  • take a for loop, which starts from 1 and ends to nums.length
  • ans[i] = ans[i-1] + num[i]
  • return the value.

Code

class Solution {
    public int[] runningSum(int[] nums) {
        int [] runningSum = new int[nums.length];
        runningSum[0] = nums[0];
        for(int i = 1; i< nums.length; i++){
            runningSum[i] = runningSum[i-1]+nums[i];
        }
        return runningSum;
    }
}
Enter fullscreen mode Exit fullscreen mode

Output

Image description

💖 💪 🙅 🚩
rifat87
Tahzib Mahmud Rifat

Posted on February 20, 2024

Join Our Newsletter. No Spam, Only the good stuff.

Sign up to receive the latest update from our blog.

Related

1480. Running Sum of 1d Array(leetcode)
beginners 1480. Running Sum of 1d Array(leetcode)

February 20, 2024