Leetcode [Merge Two Sorted Lists]

Problem : Merge Two Sorted Lists

Question

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

思路

直接用栈解决。比较简单

代码

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        newlist = ListNode(0)
        result = newlist
        while l1 != None and l2 != None:
            if l1.val > l2.val:
                newlist.next = l2
                l2 = l2.next
            else:
                newlist.next = l1
                l1 = l1.next
            newlist = newlist.next
        if l1 != None:
            newlist.next = l1
        if l2 != None:
            newlist.next = l2
        return result.next