2. Add Two Numbers
Medium
4179993FavoriteShare
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse orderand each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 + 465 = 807.
这个题目要特别注意进位和空结点问题
/**
* 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* head = new ListNode(-1);
ListNode* current = head;
int val;
int carry=0;
while(l1||l2)
{
val=0;
val+=carry;
carry=0;
if(l1)
{
val+=l1->val;
l1=l1->next;
}
if(l2)
{
val+=l2->val;
l2=l2->next;
}
ListNode* newnode = new ListNode(val);
if(val>=10)
{
newnode->val-= 10;
carry=1;
}
current->next = newnode;
current = newnode;
}
if(carry==1)
{
ListNode* newnode = new ListNode(carry);
current->next = newnode;
}
return head->next;
}
};