合并两个 链表

    1. function addTwoNumbers(l1, l2) {
    2.     const l3 = new TreeNode(0);
    3.     let p1 = l1;
    4.     let p2 = l2;
    5.     let p3 = l3;
    6.     let curry = 0;
    7.     while (p1 || p2) {
    8.         const v1 = p1 ? p1.val : 0;
    9.         const v2 = p2 ? p2.val : 0;
    10.         const val = v1 + v2 + curry;
    12.         curry = Math.floor(val / 10);
    14.         p3.next = new TreeNode(val%10);
    16.         if (p1) p1 = p1.next;
    17.         if (p2) p2 = p2.next;
    18.         p3 = p3.next;
    19.     }
    20.     if (curry) {
    21.         p3.next = new TreeNode(curry);
    22.     }
    24.     return l3.next;
    25. }
    var twoSum = function(nums, target) {
    let map = new Map();
    for(let i = 0, len = nums.length; i < len; i++){
        if(map.has(target - nums[i])){
            return [map.get(target - nums[i]), i];
        }else{
            map.set(nums[i], i);
        }
    }
    return [];
};