Add Two Numbers II

You are given two linked lists representing two non-negative numbers. 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

算法：题目不允许reverse linkedlist，那么就是用stack来实现倒着加，注意num != 0 的时候，也要继续，也就是说有carry；O(N);

/**
 * 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) {
        Stack<Integer> stack1 = new Stack<>();
        Stack<Integer> stack2 = new Stack<>();
        
        while(l1 != null) {
            stack1.push(l1.val);
            l1 = l1.next;
        }
        
        while(l2 != null) {
            stack2.push(l2.val);
            l2 = l2.next;
        }
        
        int carry = 0;
        int val = 0;
        ListNode cur = new ListNode(0);
        while( !stack1.isEmpty()|| !stack2.isEmpty() || carry != 0) {
            val = carry;
            if(!stack1.isEmpty()) {
                val += stack1.pop();
            }
            if(!stack2.isEmpty()) {
                val += stack2.pop();
            }
            carry = val / 10;
            val = val % 10;
            // 巧妙的是；倒着加，第一个node，直接赋值cur的value，然后生成新的head，cur往左移动；
            cur.val = val;
            ListNode head = new ListNode(-1);
            head.next = cur;
            cur = head;
        }
        return cur.val == -1 ? cur.next : cur;
    }
}