Running Totals List
Return a list of the same length where each node holds the sum of its own value and all the values before it. For 1 -> 2 -> 3 the answer is 1 -> 3 -> 6. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,2,3]
returns [1,3,6]
1, then 1+2, then 1+2+3.
Example 2
head [4,-4,5]
returns [4,0,5]
4, 0, 5.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Second Largest ValueBeginner
- Sum of the First KBeginner
- Sum of the ValuesBeginner
- Swap First and Last ValuesBeginner
- Values in Reverse OrderBeginner
- Add Lists Position by PositionEasy
- Append a ValueEasy
- Best Window SumEasy