1. 问题描述
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
2. 解法描述
该问题的解题思路比较明显,是否AC主要在于细节的处理。
思路:同时遍历两个链表,直至到链表的尾部,将每次遍历到元素两两相加,并注意处理进位
。
算法的时间复杂度为 O(max(m,n)) ,空间复杂度为 O(max(m,n)) 。
原始版:
public ListNode addTwoNumbers1(ListNode l1, ListNode l2) {
ListNode l3 = new ListNode(0);
ListNode l3Curr = l3;
ListNode l2Curr = l2;
ListNode l1Curr = l1;
int flag = 0;
while(l1Curr != null || l2Curr != null || flag != 0) {
int l1Value = 0;
int l2Value = 0;
if(l1Curr != null) {
l1Value = l1Curr.val;
} else {
l1Value = 0;
}
if(l2Curr != null) {
l2Value = l2Curr.val;
} else {
l2Value = 0;
}
int sum = l1Value + l2Value + flag;
flag = sum / 10;
l3Curr.val = sum % 10;
if((l1Curr != null && l1Curr.next != null) || (l2Curr != null && l2Curr.next != null) || flag != 0) {
l3Curr.next = new ListNode(0);
l3Curr = l3Curr.next;
}
if(l1Curr != null && l1Curr.next != null) {
l1Curr = l1Curr.next;
} else {
l1Curr = null;
}
if(l2Curr != null && l2Curr.next != null) {
l2Curr = l2Curr.next;
} else {
l2Curr = null;
}
}
l3Curr.next = null;
return l3;
}
优雅版:
public ListNode addTwoNumbers2(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;
}