-
Notifications
You must be signed in to change notification settings - Fork 0
/
Question34.cpp
134 lines (109 loc) · 2.08 KB
/
Question34.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
122
123
124
125
126
127
128
129
130
131
132
133
134
34 -> Delete nodes having greater value on right
Solution :
//{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node* next;
Node(int x){
data = x;
next = NULL;
}
};
void print(Node *root)
{
Node *temp = root;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}
}
// } Driver Code Ends
/*
The structure of linked list is the following
struct Node
{
int data;
Node* next;
Node(int x){
data = x;
next = NULL;
}
};
*/
class Solution
{
public:
Node* reverse(Node*head){
Node*curr=head;
Node*prev=NULL;
Node*forward=NULL;
while(curr){
forward=curr->next;
curr->next=prev;
prev=curr;
curr=forward;
}
return prev;
}
void insertatFirst(int data,Node*&ans,Node*&anshead){
if(ans==NULL){
Node* newnode = new Node(data);
ans=newnode;
anshead=newnode;
}
else{
Node* newnode = new Node(data);
newnode->next=anshead;
anshead=newnode;
}
}
Node *compute(Node *head)
{
head=reverse(head);
Node*ans=NULL;
Node*anshead=NULL;
Node*curr=head;
int prev=curr->data;
while(curr){
if(curr->data>=prev){
insertatFirst(curr->data,ans,anshead);
}
prev=max(prev,curr->data);
curr=curr->next;
}
return anshead;
}
};
//{ Driver Code Starts.
int main()
{
int T;
cin>>T;
while(T--)
{
int K;
cin>>K;
struct Node *head = NULL;
struct Node *temp = head;
for(int i=0;i<K;i++){
int data;
cin>>data;
if(head==NULL)
head=temp=new Node(data);
else
{
temp->next = new Node(data);
temp = temp->next;
}
}
Solution ob;
Node *result = ob.compute(head);
print(result);
cout<<endl;
}
}
// } Driver Code Ends