Leetcode/Add two numbers.cpp at main · 123pk/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/*
Platform :- Leetcode
Problem :- Add two numbers
Approach :- traverse through the linked lists given and maintain a variable remainder which will be added to the numbers accordingly
*/

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode*temp=l1,*temp2=l2,*head=NULL,*temp3=NULL;
        int rem=0;
        while(temp && temp2){
            int z=temp->val+temp2->val+rem;
            rem=z/10;
            ListNode*xx=new ListNode;
            xx->val=z%10;
            if(head==NULL){
                head=xx;
                temp3=xx;
                xx->next=NULL;
            }
            else{
                temp3->next=xx;
                temp3=xx;
                xx->next=NULL;
            }
            temp=temp->next;
            temp2=temp2->next;
        }

        if((!temp && !temp2)){
            if(rem){
                ListNode*xx=new ListNode;
                        xx->val=rem;
                        temp3->next=xx;
                        xx->next=NULL;
            }
            return head;
        }

        if((temp)){
            while(temp){
                int z=temp->val+rem;
                rem=z/10;
                ListNode*xx=new ListNode;
            xx->val=z%10;
            if(head==NULL){
                head=xx;
                temp3=xx;
                xx->next=NULL;
            }
            else{
                temp3->next=xx;
                temp3=xx;
                xx->next=NULL;
            }
                if((!temp->next)){
                    if(rem){
                        ListNode*xx=new ListNode;
                        xx->val=rem;
                        temp3->next=xx;
                        xx->next=NULL;
                    }
                }
                temp=temp->next;
            }
        }
        else{
            while(temp2){
                int z=temp2->val+rem;
                rem=z/10;
                ListNode*xx=new ListNode;
            xx->val=z%10;
            if(head==NULL){
                head=xx;
                temp3=xx;
                xx->next=NULL;
            }
            else{
                temp3->next=xx;
                temp3=xx;
                xx->next=NULL;
            }
                if((!temp2->next)){
                    if(rem){
                        ListNode*xx=new ListNode;
                        xx->val=rem;
                        temp3->next=xx;
                        xx->next=NULL;
                    }
                }
                temp2=temp2->next;
            }
        }
        return head;
    }
};