/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

9 votes326 views6 answers
Remove character from string C#
C#
1 vote324 views1 answer
Unity add addressables
C#
11 votes353 views3 answers
C sharp list of strings
C#
0 vote348 views1 answer
Join dictionaries keys c#
C#
0 vote323 views1 answer
File.readlines c#
C#
0 vote348 views1 answer
C# e-mail send
C#
0 vote341 views1 answer
Enzymes chemical factory
C#
0 vote356 views1 answer
C# create console for winform
C#
0 vote339 views1 answer
C# list subfolders
C#
0 vote335 views1 answer
C# double without exponential notation
C#