Merge point of two list

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 vote193 views1 answer
C# Isolation Levels
C#
0 vote217 views1 answer
Open website c#
C#
0 vote204 views1 answer
C# consuming post rest service
C#
0 vote203 views1 answer
Difference between UnitOfWork and Repository Pattern
C#
0 vote221 views1 answer
How create two database conction in laravel
C#
0 vote193 views1 answer
Netlifycms disable preview
C#
1 vote213 views1 answer
How to change the axis of a Vector3 variable
C#
4 votes156 views1 answer
Unity get animator
C#Unity
1 vote295 views1 answer
How to change scenes with button press in unity c#
C#Unity
0 vote276 views1 answer
C# wpf image source from resource programmatically
C#