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 vote307 views1 answer
C# printwindow chrome
C#
7 votes342 views4 answers
Open folder dialog c#
C#
1 vote338 views1 answer
How to configure visual studio for unity
C#
17 votes317 views2 answers
Sleep in C#
C#
0 vote329 views1 answer
Ioptions mock c# unittest
C#
1 vote326 views1 answer
Pass Method as Parameter using C#
C#
0 vote355 views1 answer
Entity Framework Core 3.1 Return value (int) from stored procedure
C#
0 vote318 views1 answer
User (current login user) in viewcomponent
C#
4 votes356 views1 answer
How to make a method wait in unity
C#Unity
1 vote360 views1 answer
Unity editor dropdown
C#Unity