LeetCode - Algorithms - 1480. Running Sum of 1d Array

Problem

1480. Running Sum of 1d Array

Java

1

1
2
3
4
5
6
7
8
9
10
11
class Solution {
    public int[] runningSum(int[] nums) {
        int[] a = new int[nums.length];
        for (int i = 0; i < nums.length; i++) {
            for (int j = 0; j <= i; j++) {
                a[i] += nums[j];
            }
        }
        return a;        
    }
}

Submission Detail

  • 53 / 53 test cases passed.
  • Runtime: 5 ms, faster than 5.83% of Java online submissions for Running Sum of 1d Array.
  • Memory Usage: 41.2 MB, less than 50.00% of Java online submissions for Running Sum of 1d Array.

2

1
2
3
4
5
6
7
8
9
10
class Solution {
    public int[] runningSum(int[] nums) {
        int[] a = new int[nums.length];
        a[0] = nums[0];
        for (int i = 1; i < nums.length; i++) {
            a[i] = a[i - 1] + nums[i];
        }
        return a;        
    }
}

Submission Detail

  • 53 / 53 test cases passed.
  • Runtime: 1 ms, faster than 10.26% of Java online submissions for Running Sum of 1d Array.
  • Memory Usage: 40.7 MB, less than 50.00% of Java online submissions for Running Sum of 1d Array.

3

1
2
3
4
5
6
7
8
9
10
11
class Solution {
    public int[] runningSum(int[] nums) {
        final int N = nums.length;
        int[] a = new int[N];
        a[0] = nums[0];
        for (int i = 1; i < N; i++) {
            a[i] = a[i - 1] + nums[i];
        }
        return a;        
    }
}

Submission Detail

  • 53 / 53 test cases passed.
  • Runtime: 0 ms, faster than 100.00% of Java online submissions for Running Sum of 1d Array.
  • Memory Usage: 40.6 MB, less than 50.00% of Java online submissions for Running Sum of 1d Array.