【架构师训练营 - week8 -1】作业

public Integer mergeNode(Node head1,Node head2){
Node node1 = head1;
Node node2 = head2;
int len = node1.length()+node2.length();
while(len>0)){
if(node1 == null){
  node1 = head2;
}
if(node2 == null){
  node2 = head1;
}
  node1 = node1.next();
  node2 = node2.next();
    if(node1.value == node2.value){
return node1.value;
}
}
return null;
}