leetCode_2

/**

* Definition for singly-linked list.

* function ListNode(val) {

* this.val = val;

* this.next = null;

* }

*/

/**

* @param{ListNode}l1

* @param{ListNode}l2

* @return{ListNode}

*/

var addTwoNumbers= function(l1,l2) {

var s = 0;

var k = [];

var v = 0;

var n = 0;

if(l1.length>= l2.length){

s = l1.length

}else{

s = l2.length

for(varp = 0;p < (l2.length- l1.length);p++){

l1.push(0)

}

}

for(vari = 0;i<s;i++){

for(varj = 0;j<l2.length;j++){

if(j == i){

v = l1[i] +l2[j]

if(v.toString()> 9){

n = v.toString()/10;

v = v.toString()%10;

l1[i+1]+=n

}

k.push(v)

}

}

}

console.log(k)

return k;

};

console.log(addTwoNumbers([4,3],[5,6,4]))