You are given two linked lists representing two non-negative numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Tags:Linked List Math
</pre><p><strong>思路(模拟手算):</strong>初始进位数carry为0,用两个指针p1、p2分别指向两个链表的第一个节点。然后计算当前位的数值:(p1.val+p2.val+carry)%10和进位数(p1.val+p2.val+carry)/10。 然后p1和p2同时向下走一步,进行同样计算。</p><p>需要注意的是,两个链表可能不一样长。</p><p></p><p>上码:</p><p><pre name="code" class="java">/*
* O(n)
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode sum;
int carry = 0;//进位
ListNode p1=l1,p2=l2;
int s = p1.val + p2.val + carry;
carry = s/10;
sum = new ListNode(s%10);
ListNode p=sum;
p1 = p1.next;
p2 = p2.next;
while(p1!=null && p2!=null){
s = p1.val + p2.val + carry;
carry = s/10;
ListNode node = new ListNode(s%10);
p.next = node;
p = p.next;
p1 = p1.next;
p2 = p2.next;
}
if (p1!=null || p2!=null) {
p1 = p1==null? p2:p1;
while(p1!=null){
s = p1.val+carry;
carry = s/10;
ListNode node = new ListNode(s%10);
p.next = node;
p = p.next;
p1 = p1.next;
}
}
if (carry > 0) {
ListNode node = new ListNode(carry);
p.next = node;
}
return sum;
}
}