week 08 作业

int length1 = 0, length2 = 0;tmp = head1;while(tmp != null) { last1 = tmp; tmp = tmp.next(); length1 ++; }
tmp = head2;while(tmp != null) {  last2 = tmp  tmp = tmp.next();  length2 ++;};
if (last1 != last2) {    return "不相交";}

if (length1>length2) {for(int i=0; i<length2 - length1; i++) {	head1 = head1.next();}} else {for(int i=0; i<length1 - length2; i++) {	head2 = head2.next();}}
while(true) {	if (head1 == head2) {   return "相交于" + head1;  }  head1 = head1.next();  head2 = head2.next();}