Alternating Sum
Start with the head and alternate the signs: add the first value, subtract the second, add the third, and so on. Return the result. An empty list gives 0. 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 [10,3,4,1]
returns 10
10 - 3 + 4 - 1 = 10.
Example 2
head [5]
returns 5
Just +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
- Are the Lists EqualBeginner
- Average of the ValuesBeginner
- Balanced Open and CloseBeginner
- Binary Linked List to IntegerBeginner
- Build a Linked List From an ArrayBeginner
- Build a List of DigitsBeginner
- Build a Range ListBeginner
- Compare Two ListsBeginner