/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 votes334 views1 answer
You have the following c# code. stringbuilder sb = new stringbuilder(really long string); the really long string variable is a string in which a very long string is stored.
C#
0 vote396 views1 answer
C# propertyinfo indexof
C#
0 vote398 views1 answer
C# moq task return null
C#
3 votes330 views6 answers
Capitalize first letter c#
C#
1 vote354 views1 answer
C# datagridview search filter
C#
0 vote307 views1 answer
C# regex get matched string
C#
0 vote315 views1 answer
Webbrowser control feature_browser_emulation compatible
C#
0 vote360 views1 answer
How to round to nearest number in array c#
C#
0 vote331 views1 answer
C# filter non alphanumeric characters
C#
0 vote378 views1 answer
Classe padre figlio c#
C#