08 周作业——数据结构与算法

current1 <- link1
current2 <- link2
// merged node
x = nil

// traverse the longer linkedlist by diff length
length1 = length of link1
length2 = length of link2
if length1 > length2 then
  diff = length1 - length2
  while current1 != nil && diff != 0 do
    current1 <- current1.next
    diff--
  end
else
  diff = lenght2 - length1
  while current2 != nil && diff != 0 do
    current2 <- current2.next
    diff--
  end
end

// traverse 2 linked list
while current1 != nil && current2 != nil do
  if current1.value = current2.value then
    if x = nil then 
      x = current1
    end
  else
    x = nil
  end
  current1 <- current1.next
  current2 <- current2.next
end

// assert
if current1 = nil && current2 = nil && x != nil then
  the merged node is x
else
  no merged node
end