DEV Community

Cover image for 1480. Running Sum of 1d Array(leetcode)
Tahzib Mahmud Rifat
Tahzib Mahmud Rifat

Posted on

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

Top comments (0)

Great read:

Is it Time to go Back to the Monolith?

History repeats itself. Everything old is new again and I’ve been around long enough to see ideas discarded, rediscovered and return triumphantly to overtake the fad. In recent years SQL has made a tremendous comeback from the dead. We love relational databases all over again. I think the Monolith will have its space odyssey moment again. Microservices and serverless are trends pushed by the cloud vendors, designed to sell us more cloud computing resources.

Microservices make very little sense financially for most use cases. Yes, they can ramp down. But when they scale up, they pay the costs in dividends. The increased observability costs alone line the pockets of the “big cloud” vendors.