-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathGFG_Add1ToNumberLL.cpp
121 lines (99 loc) · 1.99 KB
/
GFG_Add1ToNumberLL.cpp
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/*
https://practice.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1#
Add 1 to a number represented as linked list
*/
// { Driver Code Starts
//Initial template for C++
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node* next;
Node(int x){
data = x;
next = NULL;
}
};
void printList(Node* node)
{
while (node != NULL) {
cout << node->data;
node = node->next;
}
cout<<"\n";
}
// } Driver Code Ends
//User function template for C++
/*
struct Node
{
int data;
struct Node* next;
Node(int x){
data = x;
next = NULL;
}
};
*/
class Solution
{
public:
Node* reverse(Node* l1)
{
Node* prev=nullptr, *cnxt, *cur = l1;
while(cur)
{
cnxt = cur->next;
cur->next = prev;
prev = cur;
cur = cnxt;
}
return prev;
}
Node* addOne(Node *head)
{
Node* l1 = reverse(head);
int carry=1;;
Node *cur = nullptr;
while(l1)
{
carry+=l1->data;
l1=l1->next;
Node* newptr = new Node(carry%10);
newptr->next = cur;
cur = newptr;
carry = carry/10;
}
if(carry)
{
Node* newptr = new Node(carry);
newptr->next = cur;
cur = newptr;
}
return cur;
}
};
// { Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
Node* head = new Node( s[0]-'0' );
Node* tail = head;
for(int i=1; i<s.size(); i++)
{
tail->next = new Node( s[i]-'0' );
tail = tail->next;
}
Solution ob;
head = ob.addOne(head);
printList(head);
}
return 0;
}
// } Driver Code Ends