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.
Example 1:
Example 2:
Example 3:
Constraints:
[1, 100]
.0 <= Node.val <= 9
Add two nodes with carrying, store the result into a new node, and make sure that carry passes to the next calculation.
These things should notice:
leetcode
Medium
Linked List
Math