public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(0);
ListNode p = l1, q = l2, curr = dummyHead;
int carry = 0;
while (p != null || q != null) {
int x = (p != null) ? p.val : 0;
int y = (q != null) ? q.val : 0;
int sum = carry + x + y;
carry = sum / 10;
curr.next = new ListNode(sum % 10);
curr = curr.next;
if (p != null) p = p.next;
if (q != null) q = q.next;
}
if (carry > 0) {
curr.next = new ListNode(carry);
}
return dummyHead.next;
}
题解过程:
(2 -> 4 -> 3) + (5 -> 6 -> 4)
2 + 5 + 0 = 7 , carry = 0, sum % 10 = 7 => (0 -> 7)
4 + 6 + 0 = 10, carry = 1, sum % 10 = 0 => (0 -> 7 -> 0)
3 + 4 + 1 = 8 , carry = 0, sum % 10 = 8 => (0 -> 7 -> 0 -> 8)
return (7 -> 0 -> 8)
时间复杂度 O(max(m, n))
空间复杂度 O(max(m, n))
扩展:如果链表中的数字不是按逆序存储的呢?
利用栈,题解就和本题逻辑一样了。