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

1 vote320 views1 answer
Linq c# where condition
C#
1 vote301 views2 answers
Insert SQLite
C#
0 vote295 views1 answer
Darf man in hotels übernachten
C#
0 vote367 views1 answer
How to add gravity without rb in unity
C#Unity
2 votes346 views2 answers
Dictionary to list c#
C#
1 vote284 views1 answer
Make an enemy go towards player unity
C#
1 vote318 views2 answers
C# integer part of float
C#
0 vote337 views1 answer
Parse persian date string to datetime c#
C#
2 votes321 views1 answer
How to check the tag of a collider in unity
C#
3 votes350 views2 answers
C# is not marked as serializable
C#