Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
112 changes: 112 additions & 0 deletions Merge.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,112 @@

import java.util.*;


class Node
{
int data;
Node next;
Node(int d) {data = d;
next = null;}
}

class MergeLists
{
Node head;

public void addToTheLast(Node node)
{
if (head == null)
{
head = node;
}
else
{
Node temp = head;
while (temp.next != null)
temp = temp.next;
temp.next = node;
}
}


void printList()
{
Node temp = head;
while (temp != null)
{
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}



public static void main(String args[])
{

MergeLists llist1 = new MergeLists();
MergeLists llist2 = new MergeLists();


llist1.addToTheLast(new Node(5));
llist1.addToTheLast(new Node(10));
llist1.addToTheLast(new Node(15));


llist2.addToTheLast(new Node(2));
llist2.addToTheLast(new Node(3));
llist2.addToTheLast(new Node(20));


llist1.head = new Gfg().sortedMerge(llist1.head,
llist2.head);
llist1.printList();

}
}

class Gfg
{

Node sortedMerge(Node headA, Node headB)
{


Node tail = dummyNode;
while(true)
{


if(headA == null)
{
tail.next = headB;
break;
}
if(headB == null)
{
tail.next = headA;
break;
}

if(headA.data <= headB.data)
{
tail.next = headA;
headA = headA.next;
}
else
{
tail.next = headB;
headB = headB.next;
}


tail = tail.next;
}
return dummyNode.next;
}
}



6 changes: 6 additions & 0 deletions README.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
for i in range(1,101):
if(i%2==0):
print(i**2)
print("i=="+str(i))

changes updated.
4 changes: 4 additions & 0 deletions abc.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
Opened abc file.
Added a few lines.
Modifications done