File size: 1,506 Bytes
c574d3a |
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 |
class MergeLinked{
Node first,second,third,last,t;
static class Node{
int data;
Node next;
Node(int d){
data =d;
next = null;
}
}
void create(int a[], int n){
first = new Node(a[0]);
last = first;
for(int i=1; i<n; i++){
t = new Node(a[i]);
last.next = t;
last = t;
}
}
void create2(int a[], int n){
second = new Node(a[0]);
last = second;
for(int i = 1; i<n; ++i){
t = new Node(a[i]);
last.next = t;
last = t;
}
}
void merge(Node p, Node q){
if(p.data < q.data){
third = p;
last = p;
p = p.next;
last.next = null;
}
else{
third = q;
third = q;
q = q.next;
last.next = null;
}
while(p!=null & q!=null){
if(p.data<q.data){
last.next = p;
last = p;
p = p.next;
last.next = null;
}
else{
last.next = q;
last = q;
q = q.next;
last.next = null;
}
}
if(p!=null){
last.next = p;
}
if(q!=null){
last.next = q;
}
}
void Display(Node p){
while(p!=null){
System.out.print(p.data+" ");
p = p.next;
}
}
public static void main(String[] args){
MergeLinked l = new MergeLinked();
int a[] = {10,20,40,50,60};
int a1[] = {15,18,25,30,35};
l.create(a,a.length);
l.create2(a1,a.length);
l.merge(l.first,l.second);
l.Display(l.first);
}
}
|