Prefix sum array
Java
Medium
5 views
Problem Description
Task: return prefix sums where pref[i] = sum of a[0..i].
Output Format
Return value
Constraints
Use long for sums.
Official Solution
static long[] prefixSum(int[] a){long[] p=new long[a.length];long s=0;for(int i=0;i<a.length;i++){s+=a[i];p[i]=s;}return p;}
Solutions (0)
No solutions submitted yet. Be the first!
No comments yet. Start the discussion!