2. Add Two Numbers

2. Add Two Numbers

Medium

56491453FavoriteShare

You are given two non-empty linked lists representing two non-negative integers. 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.

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.

Accepted

959,689

Submissions

3,044,120

/**
 * 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) {
        int flag =0;
        int temp =0;
        ListNode *ptr = new ListNode(0);
        ListNode *res = ptr;
        while(l1!=NULL||l2!=NULL||flag!=0){
            temp=0;
            if(l1!=NULL){
                temp+=l1->val;
                l1=l1->next;
            }
            if(l2!=NULL){
                temp+=l2->val;
                l2=l2->next;
            }
            temp+=flag;
            ptr->next=new ListNode(temp%10);
            ptr=ptr->next;
            flag=temp/10;
        }
        return res->next;
    }
};