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
Solution:
/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int carry=0;
ListNode *head=NULL,*curr=head;
while(l1!=NULL||l2!=NULL){
int sum=carry;
if(l1!=NULL)
sum+=l1->val;
if(l2!=NULL)
sum+=l2->val;
if(!head){
head=new ListNode(sum%10);
curr=head;
}else{
curr->next=new ListNode(sum%10);
curr=curr->next;
}
carry=sum/10;
if(l1!=NULL)
l1=l1->next;
if(l2!=NULL)
l2=l2->next;
}
if(carry)
curr->next=new ListNode(carry);
return head;
}
};