/**
* 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) {
ListNode result = new ListNode(0);
ListNode cur = result;
int sum = 0;
while(l1 != null || l2 != null || sum > 0){
if(l1 != null) {
sum += l1.val;
l1 = l1.next;
}
if(l2 != null){
sum+= l2.val;
l2 = l2.next;
}
cur.next = new ListNode(sum%10);
cur = cur.next;
sum/=10;
}
return result.next;
}
}
node.val = sum%10;
sum/=10