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

-2 votes120 views1 answer
@razor identify last foreach
C#
0 vote168 views1 answer
Csharp attributes as generics constraints
C#
1 vote125 views1 answer
C# declare inline string array
C#
1 vote112 views1 answer
Blazor option selected
C#
0 vote124 views1 answer
How to select class object from query c#
C#
4 votes161 views1 answer
Unity how to change max fps
C#Unity
2 votes133 views1 answer
C# constructor call another constructor
C#
0 vote117 views1 answer
Generate Prime Numbers
C#
1 vote168 views1 answer
Unity3d quaternion add 90 degrees
C#Unity
0 vote130 views2 answers
Winforms reportviewer.print report
C#