class Node attr_accessor :val, :next
def initialize(val = nil) @val = val endend
def merged_linked_list(l1, l1_length, l2, l2_length) shorter_list, longer_list = l1, l2 shorter_list, longer_list = l2, l1 if l1_length > l2_length # 用Hash缓存短链表的节点以节省内存空间 shorter_list_nodes = {}
while shorter_list shorter_list_nodes[shorter_list] = true shorter_list = shorter_list.next end
while longer_list return longer_list if shorter_list_nodes[longer_list] longer_list = longer_list.next end
nilend
l1 = Node.newn2 = Node.new('Hello World!')l1.next = n2n3 = Node.newn2.next = n3n4 = Node.newn3.next = n4
l2 = Node.newn5 = Node.newl2.next = n5n5.next = n2
# 这个会输出Hello World!puts merged_linked_list(l1, 4, l2, 3).val
l2 = Node.newn5 = Node.newl2.next = n5
# 这个会输出空puts merged_linked_list(l1, 4, l2, 2)
评论