Add Two Numbers II
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Follow up: Could you solve it without reversing the input lists?
Example 1
[7] -> [2] -> [4] -> [3] -> null [5] -> [6] -> [4] -> null --- [7] -> [8] -> [0] -> [7] -> null
Input
l1 = [7,2,4,3], l2 = [5,6,4]Output
[7,8,0,7]The lists represent 7243 and 564, whose sum is 7807.
Example 2
[2] -> [4] -> [3] -> null [5] -> [6] -> [4] -> null --- [8] -> [0] -> [7] -> null
Input
l1 = [2,4,3], l2 = [5,6,4]Output
[8,0,7]The lists represent 243 and 564, whose sum is 807.
Constraints
- The number of nodes in each linked list is in the range
[1, 100]. 0 <= Node.val <= 9- It is guaranteed that the list represents a number that does not have leading zeros.