2. Add Two Numbers
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
分析
直接顺序遍历两个链表咯
源码
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* pL1 = l1, *pL2 = l2;
ListNode* rL = NULL;
ListNode* currentNode = NULL;
int carry = 0;
int a = 0, b = 0;
while(true) {
a = 0, b = 0;
if(pL1) {
a = pL1->val;
pL1 = pL1->next;
}
if(pL2) {
b = pL2->val;
pL2 = pL2->next;
}
ListNode* node = new ListNode((a + b + carry) % 10);
carry = (a + b + carry) / 10;
if(rL) {
currentNode->next = node;
} else {
rL = node;
}
currentNode = node;
if(!pL1 && !pL2 && carry == 0) {
break;
}
}
return rL;
}
};