/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public
class Solution {
public
ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode result = new
ListNode(0);
ListNode nextNode = result;
if(l1 == null)
result.next = l2;
if(l2 == null)
result.next = l1;
int
carry = 0;
while(l1 != null
&& l2 != null){
int
sum = l1.val + l2.val + carry;
nextNode.next = new
ListNode(sum % 10);
carry = sum / 10;
nextNode = nextNode.next;
l1 = l1.next;
l2 = l2.next;
}
nextNode.next = (l1 == null) ? l2 : l1;
while(nextNode.next != null){
nextNode = nextNode.next;
int
sum = nextNode.val + carry;
nextNode.val = sum % 10;
carry = sum / 10;
}
if(carry != 0){
nextNode.next = new
ListNode(carry);
nextNode = nextNode.next;
}
nextNode.next = null;
result = result.next;
return
result;
}
}
