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
Subscribe to see which companies asked this question.
解题思路:双链表求和产生新链表,较为简单,主要注意进位与两个链表的长短问题。
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* result = NULL, *temp;
ListNode* newCode;
int sum = 0;
while (l1 != NULL && l2 != NULL)
{
newCode = (ListNode*)malloc(sizeof(ListNode));
*newCode = (l1->val + l2->val + sum) % 10;
sum = (l1->val + l2->val + sum) / 10;
if (result == NULL)
{
result = newCode;
}
else
{
temp->next = newCode;
}
temp = newCode;
l1 = l1->next; l2 = l2->next;
}
while (l1 != NULL)
{
newCode = (ListNode*)malloc(sizeof(ListNode));
*newCode = (l1->val + sum) % 10;
sum = (l1->val + sum) / 10;
temp->next = newCode;
temp = newCode;
l1 = l1->next;
}
while (l2 != NULL)
{
newCode = (ListNode*)malloc(sizeof(ListNode));
*newCode = (l2->val + sum) % 10;
sum = (l2->val + sum) / 10;
temp->next = newCode;
temp = newCode;
l2 = l2->next;
}
if (sum != 0)
{
newCode = (ListNode*)malloc(sizeof(ListNode));
*newCode = sum;
temp->next = newCode;
temp = newCode;
}
return result;
}
};