In-place Prefix Sum

1 <= N <= 10^5
1 <= A[i] <= 10^3

Only argument A is an array of integers.

Return an array of integers denoting the prefix sum of the given array.

Input 1:
A = [1, 2, 3, 4, 5]

Input 2:
A = [4, 3, 2]

Output 1:
[1, 3, 6, 10, 15]

Output 2:
[4, 7, 9]

Explanation 1:
The prefix sum array of [1, 2, 3, 4, 5] is [1, 3, 6, 10, 15].

Explanation 2:
The prefix sum array of [4, 3, 2] is [4, 7, 9].

public int[] prefixSum(int[] A) {
    int n = A.length;
    for (int i = 1; i < n; i++) {
        A[i] += A[i - 1];
    }
    return A;
}

def prefix_sum(A):
    for i in range(1, len(A)):
        A[i] += A[i - 1]
    return A

function prefixSum(A) {
    for (let i = 1; i < A.length; i++) {
        A[i] += A[i - 1];
    }
    return A;
}