架构师训练营 W08 作业

class LinkedNode {
  value: string;
  next: LinkedNode
  constructor(value: string, next: LinkedNode = null) {
    this.value = value;
    this.next = next;
  }
}
function lengthOf(list: LinkedNode): number {
  let len = 0;
  let pointer: LinkedNode = list;
  while( pointer ){
    len++;
    pointer = pointer.next;
  }
  return len;
}
function findTheMergedNode(list1: LinkedNode, list2: LinkedNode): LinkedNode {
  const m: number = lengthOf(list1);
  const n: number = lengthOf(list2);
  let [longList, shortList] = m > n ? [list1, list2] : [list2, list1];
  let delta: number = Math.abs(m - n);
  while( delta-- ) {
    longList = longList.next;
  }
  // Then the length of longList and shortList is the same
  while( longList ) {
    if( longList === shortList )
      return longList;
    longList = longList.next;
    shortList = shortList.next;
  }
  return null;
}