[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
在做leetcode中和链表相关的题目时，不需要自己写输入输出，但是我们在进行本地调试的时候需要自己编写输入输出代码，完整代码如下：
# Definition for singly-linked list. class ListNode: def __init__(self, x):
self.val = x self.next = None class LinkList: def __init__(self):
self.head=None def initList(self, data): # 创建头结点 self.head = ListNode(data[0])
r=self.head p = self.head # 逐个为 data 内的数据创建结点, 建立链表 for i in data[1:]: node =
ListNode(i) p.next = node p = p.next return r def printlist(self,head): if head
== None: return node = head while node != None: print(node.val,end=' ') node =
node.next class Solution: def mergeTwoLists(self, l1, l2): """ :type l1:
ListNode :type l2: ListNode :rtype: ListNode """ head = ListNode(0) first =
head while l1!=None and l2!=None: if l1.val <= l2.val: head.next = l1 l1 =
l1.next else: head.next = l2 l2 = l2.next head = head.next if l1 != None:
head.next = l1 elif l2 != None: head.next = l2 return first.next if __name__ ==
'__main__': a = Solution() l=LinkList() data1 = [1, 2, 3] data2= [2, 4, 6]
l1=l.initList(data1) l2=l.initList(data2) l.printlist(l1) print("\r")
l.printlist(l2) print("\r") m=a.mergeTwoLists(l1,l2) l.printlist(m)
这些代码很重要！！！！
