【LeetCode with Python】 Merge Two Sorted Lists__Python

部落格網域名稱： http://www.xnerv.wang
原題頁面： https://oj.leetcode.com/problems/merge-two-sorted-lists/
題目類型：
難度評價：★
本文地址： http://blog.csdn.net/nerv3x3/article/details/3465680

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.

合并兩個有序鏈表，大學期間常見的資料結構練習題。

class Solution:    # @param two ListNodes    # @return a ListNode    def mergeTwoLists(self, l1, l2):        if None == l1 and None == l2:            return None        elif None == l1:            return l2        elif None == l2:            return l1        new_list = ListNode(0)        cur = new_list        node1 = l1        node2 = l2        while None != node1 and None != node2:            if node1.val < node2.val:                cur.next = node1                node1 = node1.next            else:                cur.next = node2                node2 = node2.next            cur = cur.next        if None != node1:            cur.next = node1        else:            cur.next = node2        return new_list.next