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 vote222 views1 answer
C# get all bytes of a file
C#
0 vote229 views2 answers
C# stringbuilder to file
C#
36 votes206 views5 answers
C# string to byte array
C#
0 vote209 views1 answer
Get patht bim 360 revit api
C#
3 votes219 views1 answer
C# center text
C#
10 votes272 views3 answers
How to lock and hide a cursor unity
C#Unity
9 votes216 views3 answers
Ef update database
C#
0 vote261 views1 answer
Moving camera with touch screen unity
C#
3 votes225 views1 answer
C# find item in list
C#
0 vote219 views1 answer
Degree between two points latitude longitude c#
C#