[LeetCode][Python3] 21. Merge Two Sorted Lists

Problem :

https://leetcode.com/problems/merge-two-sorted-lists/description/

My Solution :

# Definition for singly-linked list.

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

def mergeTwoLists(self, l1, l2):

"""

:type l1: ListNode

:type l2: ListNode

:rtype: ListNode

"""

head = ListNode(0)

current = head

while l1 and l2:

if l1.val < l2.val:

current.next = l1

l1 = l1.next

else:

current.next = l2

l2 = l2.next

current = current.next

current.next = l1 or l2

return head.next

Comment :

내가 한번에 풀어서 실수 없이 통과하는 경우는 별로 없었는데, 이 문제는 한번에 통과했다. None 입력 말고는 딱히 주의할만한 Edge Case가 없어서 그런 듯.