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
-----------
1。 直接尾插 2。变为整数,计算后再变回去
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* head = NULL;
ListNode* tail = NULL;
int add = 0;
while(l1 != NULL && l2 != NULL) {
int sum = l1->val + l2->val + add;
ListNode* n = new ListNode(sum % 10);
add = sum / 10;
if (head == NULL) {
head = n;
}
if (tail != NULL) {
tail->next = n;
}
tail = n;
l1 = l1->next;
l2 = l2->next;
}
ListNode* have = l1 != NULL ? l1 : l2;
while (have != NULL) {
int sum = have->val + add;
ListNode* n = new ListNode(sum % 10);
add = sum / 10;
if (head == NULL) {
head = n;
}
if (tail != NULL) {
tail ->next = n;
}
tail = n;
have = have->next;
}
if (add != 0) {
ListNode* n = new ListNode(add);
tail->next = n;
tail = n;
}
if (tail != NULL) {
tail->next = NULL;
}
return head;
}
};
别人代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
int carry = 0;
ListNode* tail = new ListNode(0);
ListNode* ptr = tail;
while(l1 != NULL || l2 != NULL){
int val1 = 0;
if(l1 != NULL){
val1 = l1->val;
l1 = l1->next;
}
int val2 = 0;
if(l2 != NULL){
val2 = l2->val;
l2 = l2->next;
}
int tmp = val1 + val2 + carry;
ptr->next = new ListNode(tmp % 10);
carry = tmp / 10;
ptr = ptr->next;
}
if(carry == 1){
ptr->next = new ListNode(1);
}
return tail->next;
}
};