/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

1 vote222 views1 answer
Mymove() method c#
C#
0 vote244 views1 answer
C# calculate sum of list
C#
-1 vote208 views1 answer
Strinng.indexOf c#
C#
23 votes220 views2 answers
Unity send message to console
C#Unity
0 vote216 views1 answer
Enum extends dictionary c#
C#
4 votes227 views1 answer
Get enum by index c#
C#
0 vote209 views1 answer
C# system dont let write txt file
C#
0 vote201 views1 answer
How to clear stackpanel wpf
C#
0 vote204 views1 answer
C# How to change the text colour?
C#
16 votes217 views2 answers
C# delete file if exists
C#