[LeetCode] 21. Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

 

Example 1:

Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]

Example 2:

Input: list1 = [], list2 = []
Output: []

Example 3:

Input: list1 = [], list2 = [0]
Output: [0]

 

Constraints:

• The number of nodes in both lists is in the range [0, 50].
• -100 <= Node.val <= 100
• Both list1 and list2 are sorted in non-decreasing order.

---

주어진 두 Listd의 숫자들을 Sort하여 하나의 ListNode로 만드는 문제이다.

두 List의 위치를 표시한 후 각 위치의 값을 비교하여 새로운 ListNode에 순서대로 넣는다. 

 

class Solution:
   def mergeTwoLists(self, l1, l2):
       dummy = cur = ListNode(0)
       while l1 and l2:
           if l1.val < l2.val:
               cur.next = l1
               l1 = l1.next
           else:
               cur.next = l2
               l2 = l2.next
           cur = cur.next
       cur.next = l1 or l2
       return dummy.next

 

문제 출처 : https://leetcode.com/problems/merge-two-sorted-lists/

Merge Two Sorted Lists - LeetCode

Github : https://github.com/kkkkang1009/leetcode/blob/master/leetcode_21.py

GitHub - kkkkang1009/leetcode: leetcode