2. Add Two Numbers

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.

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

/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */

var addTwoNumbers = function(l1, l2) {
    var carry = 0,
        result = new ListNode(0),
        temp = result;
    
    while(l1 || l2){
        l1 = l1 || new ListNode(0);
        l2 = l2 || new ListNode(0);
        
        temp.next = new ListNode((l1.val + l2.val + carry) % 10);
        carry = (l1.val + l2.val + carry) > 9 ? 1: 0;
        
        temp = temp.next;
        l1 = l1.next;
        l2 = l2.next;
    }
    
    if(carry){
        temp.next = new ListNode(carry);
        temp = temp.next;
    }
    
    return result.next; 
};