Approach Summary
For each index i ≥ 1, nums[i] += nums[i-1]. The simplest prefix sum in-place.
How to Recognize This Pattern
- Cumulative sum array
- Base case for prefix sum problems
Complexity Analysis
Time Complexity
O(n)
Space Complexity
O(1)
Tags
Array Prefix Sum