-
Notifications
You must be signed in to change notification settings - Fork 36
/
MergeTwoSortedLL.cpp
153 lines (127 loc) · 2.71 KB
/
MergeTwoSortedLL.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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
//Question: "merge two sorted linked lists" on gfg
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
/* Link list node */
struct Node
{
int data;
struct Node* next;
};
/* pull off the front node of the source and put it in dest */
void MoveNode(struct Node** destRef, struct Node** sourceRef);
struct Node* SortedMerge(struct Node* a, struct Node* b)
{
struct Node *curr=NULL;
struct Node *head=NULL;
if(a->data < b->data)
{
curr=a;
head=a;
a=a->next;
}
else
{
curr=b;
head=b;
b=b->next;
}
while(1)
{
if(a->data>b->data)
{
curr->next=b;
curr=b;
b=b->next;
}
else
{
curr->next=a;
curr=a;
a=a->next;
}
if(a==NULL)
{
curr->next=b;
break;
}
if(b==NULL)
{
curr->next=a;
break;
}
}
return head;
}
void MoveNode(struct Node** destRef, struct Node** sourceRef)
{
/* the front source node */
struct Node* newNode = *sourceRef;
assert(newNode != NULL);
/* Advance the source pointer */
*sourceRef = newNode->next;
/* Link the old dest off the new node */
newNode->next = *destRef;
/* Move dest to point to the new node */
*destRef = newNode;
}
/* Function to insert a node at the beginging of the
linked list */
void push(struct Node** head_ref, int new_data)
{
/* allocate node */
struct Node* new_node =
(struct Node*) malloc(sizeof(struct Node));
/* put in the data */
new_node->data = new_data;
/* link the old list off the new node */
new_node->next = (*head_ref);
/* move the head to point to the new node */
(*head_ref) = new_node;
}
/* Function to print nodes in a given linked list */
void printList(struct Node *node)
{
while (node!=NULL)
{
printf("%d ", node->data);
node = node->next;
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d",&n);
scanf("%d",&m);
/* Start with the empty list */
struct Node* res = NULL;
struct Node* a = NULL;
struct Node* b = NULL;
int arr[n];
for (int i = 0; i < n; ++i)
{
scanf("%d",&arr[i]);
}
for (int i = n-1; i >=0; i--)
{
push(&a, arr[i]);
}
int arr1[m];
for(int i = 0; i<m; i++)
{
scanf("%d",&arr1[i]);
}
for(int i = m-1; i>=0; i--)
{
push(&b, arr1[i]);
}
res = SortedMerge(a, b);
printList(res);
printf("\n");
}
return 0;
}