/C#/Check if two linked lists merge. If so, where?

Check if two linked lists merge. If so, where?

int FindMergeNode(Node headA, Node headB) {
  Node currentA = headA;
  Node currentB = headB;

  // Do till the two nodes are the same
  while (currentA != currentB) {
    // If you reached the end of one list start at the beginning of the other
    // one currentA
    if (currentA.next == null) {
      currentA = headA;
    } else {
      currentA = currentA.next;
    }
    // currentB
    if (currentB.next == null) {
      currentB = headB;
    } else {
      currentB = currentB.next;
    }
  }
  return currentB.data;
}

Source: stackoverflow.com

Similar codes

43 votes204 views3 answers
.net loop through dictionary
C#
5 votes162 views4 answers
C# linq foreach example
C#
0 vote153 views1 answer
C# loop 2 time tables
C#
2 votes325 views1 answer
Unity spawn object at position
C#Unity
2 votes179 views2 answers
How get query from url in laravel
C#
0 vote171 views1 answer
Github action get commit tag
C#
14 votes170 views6 answers
C# convert list to string
C#
1 vote232 views1 answer
Optimistic update
C#
0 vote157 views1 answer
LsbCat.Items.Clear();lsbCat.Items.AddRange(Cats.ToArray());txtCat.Clear();
C#
0 vote215 views1 answer
Check if process is open c#
C#