We’re preparing your current view and syncing the latest data.
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, 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.
Two linked lists, each node contains a single digit in reverse order.
A linked list representing the sum of the two numbers, also in reverse order.
The number of nodes in each linked list is in the range [1, 100]. 0 <= Node.val <= 9 The input lists represent non-negative integers without leading zeros.
Example 1
Input
l1 = [2,4,3], l2 = [5,6,4]
Output
[7,0,8]
Explanation
342 + 465 = 807, represented as [7,0,8] in reverse order.