public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(-1);
dummy.next = l1;
ListNode pre1 = new ListNode(-1);
pre1.next = l1;
int temp = 0;
while(l1 != null || l2 != null) {
if (l1 == null) {
pre1.next = l2;
while (temp != 0 && pre1.next != null) {
pre1.next.val += 1;
temp = 0;
if (pre1.next.val >= 10) {
pre1.next.val %= 10;
pre1 = pre1.next;
temp = 1;
}
}
break;
}
if (l2 == null) {
while (temp == 1 && pre1.next != null) {
pre1.next.val += 1;
temp = 0;
if (pre1.next.val >= 10) {
pre1.next.val %= 10;
pre1 = pre1.next;
temp = 1;
}
}
break;
}
l1.val = l1.val + l2.val + temp;
if (l1.val >= 10) {
l1.val %= 10;
temp = 1;
} else {
temp = 0;
}
l1 = l1.next;
l2 = l2.next;
pre1 = pre1.next;
}
if (temp == 1) {
pre1.next = new ListNode(1);
}
return dummy.next;
}
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(-1);
dummy.next = l1;
ListNode pre1 = new ListNode(-1);
pre1.next = l1;
int temp = 0;
while(l1 != null || l2 != null) {
if (l1 == null) {
pre1.next = l2;
while (temp != 0 && pre1.next != null) {
pre1.next.val += 1;
temp = 0;
if (pre1.next.val >= 10) {
pre1.next.val %= 10;
pre1 = pre1.next;
temp = 1;
}
}
break;
}
if (l2 == null) {
while (temp == 1 && pre1.next != null) {
pre1.next.val += 1;
temp = 0;
if (pre1.next.val >= 10) {
pre1.next.val %= 10;
pre1 = pre1.next;
temp = 1;
}
}
break;
}
l1.val = l1.val + l2.val + temp;
if (l1.val >= 10) {
l1.val %= 10;
temp = 1;
} else {
temp = 0;
}
l1 = l1.next;
l2 = l2.next;
pre1 = pre1.next;
}
if (temp == 1) {
pre1.next = new ListNode(1);
}
return dummy.next;
}
}