Daily-Problems-LeetCode/2.AddTwoNumbersSimplified.cpp at main · frostbyte012/Daily-Problems-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
#include<bits/stdc++.h>
using namespace std;


class Solution {

  struct ListNode {
   int val;
   ListNode *next;
   ListNode() : val(0), next(nullptr) {}
   ListNode(int x) : val(x), next(nullptr) {}
   ListNode(int x, ListNode *next) : val(x), next(next) {}
 };


public:


    int reverse(int n)
    {
        int x=n,s=0;
        while(x)
        {
            s=(x%10)+(s*10);
            x=x/10;
        }
        return s;

    }

    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {

        int x=0,copy=0,sum=0,s=0,a=0;

        while(l1)
        {
            int x=l1->val;

            s=s*10+x;

            l1=l1->next;

        }

        while(l2){
          int y=l2->val;
          a=a*10+y;
          l2=l2->next;
        }

        s=reverse(s);
        a=reverse(a);

        sum=a+s;
        copy=sum;

        ListNode* temp;
        ListNode* h=new ListNode(0);

        temp=h;

        if(copy==0)
        {

            return h;

        }

        else{

            while(copy)
            {
              x=copy%10;
              copy=copy/10;
              ListNode* node=new ListNode(x);
              temp->next=node;
              temp=temp->next;

            }

            temp->next=NULL;
          }

        return h->next;
    }
};