题目地址
题目描述:
链表的数学求和,例子如下,很好理解的一个题目:
Input : (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
code:
/**
* 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) {
ListNode *num1 = l1;
ListNode *num2 = l2;
int carry = 0;
ListNode *sumNode = new ListNode(0);
ListNode *temp = sumNode;
while(num1 != NULL || num2 != NULL)
{
int val1 = (num1 == NULL)?0:num1->val;
int val2 = (num2 == NULL)?0:num2->val;
int sum = carry + val1 + val2;
carry = sum / 10;
sumNode->next = new ListNode(sum % 10);
sumNode = sumNode->next;
if (num1 != NULL) num1 = num1->next;
if (num2 != NULL) num2 = num2->next;
}
if (carry > 0)
{
sumNode->next = new ListNode(carry);
}
return temp->next;
}
};