面试题 02.05. 链表求和

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode();
ListNode pre = dummyHead;

int carry = 0;
while (carry != 0 || l1 != null || l2 != null) {
int sum = carry;
if (l1 != null) {
sum += l1.val;
l1 = l1.next;
}
if (l2 != null) {
sum += l2.val;
l2 = l2.next;
}

pre = pre.next = new ListNode(sum % 10);
carry = sum / 10;
}

return dummyHead.next;
}
}

References

面试题 02.05. 链表求和