Add Two Numbers
Total Accepted: 135836
Total Submissions: 594520
Difficulty: Medium
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
Hide Similar Problems
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 newH(0);
ListNode *p = &newH;
int sum = 0;
while(l1 || l2){
sum /= 10;
if(l1){
sum += l1->val;
l1 = l1->next;
}
if(l2){
sum += l2->val;
l2 = l2->next;
}
p->next = new ListNode(sum%10);
p = p->next;
}
if(sum/10) p->next = new ListNode(1);
return newH.next;
}
};