题目:
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)
题意:两数相加,考虑进位等。
C++版:
class Solution{
public:
ListNode *addTwoNumbers(ListNode* l1, ListNode* l2){
ListNode dummy(-1);
ListNode* prev = &dummy;
int carry = 0;
for(ListNode *pa=l1, *pb=l2; pa!=nullptr || pb!=nullptr;
pa = pa==nullptr ? nullptr : pa->next,
pb = pb==nullptr ? nullptr : pb->next,
prev = prev->next){
const int ai = pa==nullptr ? 0 : pa->val;
const int bi = pb==nullptr ? 0 : pb->val,
const int val = (ai+bi+carry)%10;
carry = (ai+bi+carry)/10;
prev->next = new ListNode(val);
}
if(carry>0){
prev->next = new ListNode(carry);
}
return dummy.next;
}
};
java版:
public class Solution{
public ListNode addTwoNumbers(ListNode l1, ListNode l2){
ListNode pa = l1;
ListNode pb = l2;
ListNode result = new ListNode(0);
ListNode prev = result;
int sum = 0;
while(pa!=null || pa!=null){
sum /= 10;
if(pa!=null){
sum += pa.val;
pa = pa.next;
}
if(pb!=null){
sum += pb.val;
pb = pb.next;
}
prev.next = new ListNode(sum%10);
prev = prev.next;
}
if(sum/10==1){
prev.next = new ListNode(1);
}
return result.next;
}
}