Merge-two-sorted-linked-lists

Author: keshavsingh3197

HackerRank/Data Structure/Linked Lists/Linked-Lists.ipynb

@@ -496,14 +496,109 @@
     "    print(compare(l1,l2))"
    ]
   },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# Merge two sorted linked lists\n"
+   ]
+  },
   {
    "cell_type": "code",
-   "execution_count": 38,
+   "execution_count": 18,
    "metadata": {},
-   "outputs": [],
+   "outputs": [
+    {
+     "name": "stdin",
+     "output_type": "stream",
+     "text": [
+      " 1\n",
+      " 3\n",
+      " 1\n",
+      " 2\n",
+      " 3\n",
+      " 2\n",
+      " 3\n",
+      " 4\n"
+     ]
+    },
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "1\n",
+      "2\n",
+      "3\n",
+      "3\n",
+      "4\n"
+     ]
+    }
+   ],
    "source": [
-    "if 3 and None:\n",
-    "    print('k')"
+    "# %load Merge-two-sorted-linked-lists.py\n",
+    "class node:\n",
+    "    def __init__(self,data):\n",
+    "        self.data=data\n",
+    "        self.next=None\n",
+    "class LinkedList:\n",
+    "    def __init__(self):\n",
+    "        self.start=None\n",
+    "def display(head):\n",
+    "    if head==None:\n",
+    "        print('list is empty')\n",
+    "    else:\n",
+    "        temp=head\n",
+    "        while temp:\n",
+    "            print(temp.data)\n",
+    "            temp=temp.next\n",
+    "\n",
+    "def merge(l1,l2):\n",
+    "    l=LinkedList()\n",
+    "    ptr=l\n",
+    "    while l1 or l2:\n",
+    "        if l1 is None:\n",
+    "            ptr.next=l2\n",
+    "            break\n",
+    "        elif l2 is None:\n",
+    "            ptr.next=l1\n",
+    "            break\n",
+    "        else:\n",
+    "            if l1.data>l2.data:\n",
+    "                ptr.next=l2\n",
+    "                l2=l2.next\n",
+    "            else:\n",
+    "                ptr.next=l1\n",
+    "                l1=l1.next\n",
+    "            ptr=ptr.next\n",
+    "    return l.next\n",
+    "#     if l1 is None and l2 is None:\n",
+    "#         return None\n",
+    "#     if l1 is None:\n",
+    "#         return l2\n",
+    "#     if l2 is None:\n",
+    "#         return l1\n",
+    "#     if l1.data>l2.data:\n",
+    "#         l=l2\n",
+    "#         l.next=merge(l1,l2.next)\n",
+    "#     else:\n",
+    "#         l=l1\n",
+    "#         l.next=merge(l1.next,l2)\n",
+    "#     return l\n",
+    "def addElemntInLinkedList():\n",
+    "    l=LinkedList()\n",
+    "    for i in range(int(input())):\n",
+    "        n=int(input())\n",
+    "        if l .start==None:\n",
+    "            l.start=node(n)\n",
+    "            ptr=l.start\n",
+    "        else:\n",
+    "            ptr.next=node(n)\n",
+    "            ptr=ptr.next\n",
+    "    return l.start\n",
+    "for _ in range(int(input())):\n",
+    "    l1=addElemntInLinkedList()\n",
+    "    l2=addElemntInLinkedList()\n",
+    "    display(merge(l1,l2))"
    ]
   },
   {

HackerRank/Data Structure/Linked Lists/Merge-two-sorted-linked-lists.py

@@ -0,0 +1,63 @@
+class node:
+    def __init__(self,data):
+        self.data=data
+        self.next=None
+class LinkedList:
+    def __init__(self):
+        self.start=None
+def display(head):
+    if head==None:
+        print('list is empty')
+    else:
+        temp=head
+        while temp:
+            print(temp.data)
+            temp=temp.next
+
+def merge(l1,l2):
+    l=LinkedList()
+    ptr=l
+    while l1 or l2:
+        if l1 is None:
+            ptr.next=l2
+            break
+        elif l2 is None:
+            ptr.next=l1
+            break
+        else:
+            if l1.data>l2.data:
+                ptr.next=l2
+                l2=l2.next
+            else:
+                ptr.next=l1
+                l1=l1.next
+            ptr=ptr.next
+    return l.next
+#     if l1 is None and l2 is None:
+#         return None
+#     if l1 is None:
+#         return l2
+#     if l2 is None:
+#         return l1
+#     if l1.data>l2.data:
+#         l=l2
+#         l.next=merge(l1,l2.next)
+#     else:
+#         l=l1
+#         l.next=merge(l1.next,l2)
+#     return l
+def addElemntInLinkedList():
+    l=LinkedList()
+    for i in range(int(input())):
+        n=int(input())
+        if l .start==None:
+            l.start=node(n)
+            ptr=l.start
+        else:
+            ptr.next=node(n)
+            ptr=ptr.next
+    return l.start
+for _ in range(int(input())):
+    l1=addElemntInLinkedList()
+    l2=addElemntInLinkedList()
+    display(merge(l1,l2))