#Python Code
#Code for merging the two sorted linked list
class Solution(object):
def mergeTwoLists(self, list1, list2):
"""
:type list1: Optional[ListNode]
:type list2: Optional[ListNode]
:rtype: Optional[ListNode]
"""
ans = tail = ListNode()
if (list1.val<list2.val):
ans = list1
else:
ans = list2
tail = ans
while (list1 and list2):
if(list1.val<list2.val):
tail.next=list1
tail=tail.next
list1=list1.next
else:
tail.next=list2
tail=tail.next
list2=list2.next
if(list1!=None):
tail.next=list1
if(list2!=None):
tail.next=list2
return ans
#Code for merging the two sorted linked list
class Solution(object):
def mergeTwoLists(self, list1, list2):
"""
:type list1: Optional[ListNode]
:type list2: Optional[ListNode]
:rtype: Optional[ListNode]
"""
ans = tail = ListNode()
if (list1.val<list2.val):
ans = list1
else:
ans = list2
tail = ans
while (list1 and list2):
if(list1.val<list2.val):
tail.next=list1
tail=tail.next
list1=list1.next
else:
tail.next=list2
tail=tail.next
list2=list2.next
if(list1!=None):
tail.next=list1
if(list2!=None):
tail.next=list2
return ans