Prefix sum array in Python using accumulate function
We are given an array, find prefix sums of given array.
Examples:
Input : arr = [1, 2, 3] Output : sum = [1, 3, 6] Input : arr = [4, 6, 12] Output : sum = [4, 10, 22]
A prefix sum is a sequence of partial sums of a given sequence. For example, the cumulative sums of the sequence {a, b, c, …} are a, a+b, a+b+c and so on. We can solve this problem in python quickly using accumulate(iterable) method.
# function to find cumulative sum of array from itertools import accumulate def cumulativeSum(input): print ("Sum :", list(accumulate(input))) # Driver program if __name__ == "__main__": input = [4, 6, 12] cumulativeSum(input) |
chevron_right
filter_none
Output:
Sum = [4, 10, 22]
Recommended Posts:
- Rearrange the array to maximize the number of primes in prefix sum of the array
- Count the number of primes in the prefix sum array of the given array
- Python | Prefix sum list
- Prefix Sum of Matrix (Or 2D Array)
- Python | Get the numeric prefix of given string
- Sum 2D array in Python using map() function
- Longest prefix that contains same number of X and Y in an array
- Python | Prefix Sum Subarray till False value
- Prefix matching in Python using pytrie module
- Python | Split strings in list with same prefix in all elements
- Python program to print the substrings that are prefix of the given string
- Maximum array sum with prefix and suffix multiplications with -1 allowed
- Prefix Sum Array - Implementation and Applications in Competitive Programming
- Index with Minimum sum of prefix and suffix sums in an Array
- Python | Ways to convert array of strings to array of floats
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
- Count array elements that divide the sum of all other elements
- Maximum element in a sorted and rotated array
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Maximum sum such that no two elements are adjacent | Set 2
- Find two numbers whose divisors are given in a random order
