@@ -0,0 +1,692 @@
+%22%22%22Leetcode 21. Merge Two Sorted Lists%0AEasy%0A%0AURL: https://leetcode.com/problems/merge-two-sorted-lists/%0A%0AMerge two sorted linked lists and return it as a new list. %0AThe new list should be made by splicing together the nodes of the first two lists.%0A%0AExample:%0AInput: 1-%3E2-%3E4, 1-%3E3-%3E4%0AOutput: 1-%3E1-%3E2-%3E3-%3E4-%3E4%0A%22%22%22%0A%0A# Definition for singly-linked list.%0Aclass ListNode(object):%0A    def __init__(self, val):%0A        self.val = val%0A        self.next = None%0A%0A%0Aclass Solution(object):%0A    def mergeTwoLists(self, l1, l2):%0A        %22%22%22%0A        :type l1: ListNode%0A        :type l2: ListNode%0A        :rtype: ListNode%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc021_merge_two_sorted_lists.py