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

Tahzib Mahmud Rifat @rifat87

About: Open source || Backend-Development || IoT || Robotics || Computer Vision

Joined:
Feb 13, 2024

1480. Running Sum of 1d Array(leetcode)

Publish Date: Feb 20 '24
0 0

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

Comments 0 total

    Add comment