Add Two Numbers Represented by Linked Lists
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, such that the head of the list contains the least significant digit. Each node contains exactly one digit. Add the two numbers and return the sum as a new linked list. 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, except for the number 0 itself.
JavaSingly Linked ListIterative Algorithm
00