/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

0 vote150 views1 answer
Dapper Get List
C#
0 vote176 views1 answer
Destructure array in c#
C#
1 vote302 views1 answer
C# datagridview change column name
C#
2 votes145 views1 answer
C# socket receive
C#
0 vote145 views1 answer
Sort number in dynamo
C#
0 vote199 views1 answer
Unity Interstitial ad C#
C#Unity
1 vote148 views4 answers
Linq where c#
C#
0 vote167 views1 answer
Button color uwp c#
C#
0 vote149 views1 answer
C# object to dictionary
C#
0 vote163 views1 answer
How to skip bin/Debug/netcoreapp3.1/ on the reltaive path
C#