/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 vote202 views1 answer
Mapping dictionary to object c#
C#
0 vote189 views1 answer
How to concert a list into strinf splitted by coma c#
C#
1 vote199 views1 answer
Test how catch exception c#
C#
0 vote199 views1 answer
Unity string lowercase
C#
0 vote201 views2 answers
Create expression func c# for use in where clause
C#
120 votes320 views6 answers
C# math random
C#
1 vote185 views1 answer
Teleport in vue
C#
0 vote193 views1 answer
Netlifycms disable preview
C#
2 votes217 views1 answer
C# get last array element
C#
2 votes187 views1 answer
C# Thread Sleep vs Task Delay
C#