# 2. Add Two Numbers

## Description

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 contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

**Example:**

> **Input:** (2 -> 4 -> 3) + (5 -> 6 -> 4)&#x20;
>
> **Output:** 7 -> 0 -> 8&#x20;
>
> **Explanation:** 342 + 465 = 807.

## code

```java
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode head = new ListNode();
        ListNode next = head;
        int t = 0;
        while(l1 != null || l2 != null || t != 0) {
            int sum = 0;
            if (l1 != null) {
                sum += l1.val;
                l1 = l1.next;
            }
            if (l2 != null) {
                sum += l2.val;
                l2 = l2.next;
            }
            ListNode node = new ListNode((sum + t) % 10);
            next.next = node;
            next = node;
            t = (sum + t) / 10;
        }
        return head.next;
    }
}
```
