445. 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 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.

Follow up:
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.

Example:

Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 8 -> 0 -> 7

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        Stack<ListNode> stack1 = new Stack<>();
        Stack<ListNode> stack2 = new Stack<>();
        ListNode node = l1;
        while (node != null) {
            stack1.push(node);
            node = node.next;
        }
        node = l2;
        while (node != null) {
            stack2.push(node);
            node = node.next;
        }
        ListNode dummy = new ListNode(0);

        int carry = 0;
        while (!stack1.isEmpty() && !stack2.isEmpty()) {
            int sum = carry + stack1.pop().val + stack2.pop().val;
            ListNode tmp = new ListNode(sum % 10);
            carry = sum / 10;
            tmp.next = dummy.next;
            dummy.next = tmp;
        }
        while (!stack1.isEmpty()) {
            int sum = carry + stack1.pop().val;
            ListNode tmp = new ListNode(sum % 10);
            carry = sum / 10;
            tmp.next = dummy.next;
            dummy.next = tmp;
        }
        while (!stack2.isEmpty()) {
            int sum = carry + stack2.pop().val;
            ListNode tmp = new ListNode(sum % 10);
            carry = sum / 10;
            tmp.next = dummy.next;
            dummy.next = tmp;
        }
        if (carry != 0) {
            ListNode tmp = new ListNode(carry);
            tmp.next = dummy.next;
            dummy.next = tmp;
        }
        return dummy.next;
    }
}