/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

3 votes287 views1 answer
How do I print something in the console at the start of the game unity
C#
0 vote250 views2 answers
Ggplot2 multiple lines geom_line
C#
21 votes299 views2 answers
Random.range unity
C#
0 vote292 views1 answer
If input.get touch
C#
0 vote277 views1 answer
C# windows application get current path
C#
0 vote319 views1 answer
Actual vector3 object unity
C#Unity
1 vote277 views1 answer
How to access individual characters in a string in c#
C#
0 vote295 views1 answer
Clickable table row asp.net core
C#
11 votes307 views2 answers
How to check if an integer is in array c#
C#
0 vote325 views1 answer
Linq left join group by
C#